def flight_table(n, incoming, outgoing):
    table = [[i == j for i in range(n)] for j in range(n)]
    for i in range(n):
        for j in range(i+1, n):
            if outgoing[j-1] == 'N' or incoming[j] == 'N':
                break
            table[i][j] = True
        for j in reversed(range(i)):
            if outgoing[j+1] == 'N' or incoming[j] == 'N':
                break
            table[i][j] = True
    return table

for c in range(int(input())):
    print(f'Case #{c+1}:')
    for line in flight_table(int(input()), input().strip(), input().strip()):
        print(''.join('NY'[x] for x in line))

from collections import Counter

def fusable(shards):
    c = Counter(shards)
    return abs(c['A'] - c['B']) == 1

for c in range(int(input())):
    input()
    shards = input().strip()
    print(f'Case #{c+1}: {"NY"[fusable(shards)]}')

def longest_interval(logs):
    logs.sort()
    seq = {}
    for pos, height in logs:
        for start, stop in [(pos, pos+height), (pos-height, pos)]:
            if start not in seq:
                seq[start] = 0
            if stop not in seq:
                seq[stop] = seq[start] + height
            else:
                seq[stop] = max(seq[stop], seq[start] + height)
    return max(seq.values())

for c in range(int(input())):
    logs = [[int(n) for n in input().split()] for _ in range(int(input()))]
    print(f'Case #{c+1}: {longest_interval(logs)}')