c = input()
for i in range(1,4):
    print(' '*(3-i)+c*(2*i-1))

c = input()
c = c.upper()
print(c)

num = input().strip()
print(num[::-1])

t,n = map(float,input().split())
print("{:.3f}\n{:.0f}".format(t/n,2*n))

lst=list(map(float,input().split()))
p = sum(lst)/2
s = p
for i in range(3):
    s *= p - lst[i]
s **= 1/2
print("{:.1f}".format(s))

import math
s,v = map(int,input().split())
t = (8*60-10-math.ceil(s/v))
h = (t//60)%24
m = t%60
print("{:02}:{:02}".format(h,m))

m,t,s=map(int,input().split())
if s<m*t:
    print(int(m-s/t))
else:
    print(0)

n = int(input())
print("Local" if 5 * n < 3 * n + 11 else "Luogu")

m,h = map(float,input().split())
res = m/h**2
if res<18.5:
    print("Underweight")
elif res>=18.5 and res<24:
    print("Normal")
else:
    print("{:6g}".format(res))
    print("Overweight")

lst = list(map(int,input().split()))
lst.sort()
for i in lst:
    print(i,end=' ')

yy,mm=map(int,input().split())
m1 = (1,3,5,7,8,10,12)
m2 = (4,6,9,11)
def is_leap(yy):
    if yy%100==0:
        if yy % 400 == 0:
            return 1
        return 0
    else:
        if yy % 4 == 0:
            return 1
        return 0
if mm in m1:
    print(31)
elif mm in m2:
    print(30)
else:
    if is_leap(yy):
        print(29)
    else:
        print(28)

arr = []
for i in range(7):
    a ,b = map(int,input().split())
    arr.append(a+b)
print(arr.index(max(arr))+1 if max(arr)>8 else 0)

side = list(map(int, input().split()))
side.sort()
if sum(side[:2])>side[-1]:
    if side[0]**2+side[1]**2==side[-1]**2:
        print("Right triangle")
    elif side[0]**2+side[1]**2>side[-1]**2:
        print("Acute triangle")
    else:
        print("Obtuse triangle")
    if side[0]==side[1] or side[1]==side[-1]:
        print("Isosceles triangle")
        if side[0]==side[-1]:
            print("Equilateral triangle")
else:
    print("Not triangle")

n = int(input())
if n <= 150:
    print("{:.1f}".format(n * 0.4463))
elif n <= 400:
    print("{:.1f}".format(150 * 0.4463 + (n - 150) * 0.4663))
else:
    print("{:.1f}".format(150 * 0.4463 + 250 * 0.4663 + (n - 400) * 0.5663))

x ,n = map(int, input().split())
day = n // 7 * 5
rem = n % 7
if rem:
    if x + rem ==7 or x == 7: //如开始为周日肯定只休息一天；如r+x==7即最后一天为周六，也休息一天
        rem -= 1
    elif x + rem >= 8: //最后一天已过周日，休息两天
        rem -= 2
print((day+rem)*250)

side = list(map(int, input().split()))
side.sort()
a = side[2]
b = side[0]
while a % b:
    temp = a % b
    a = b
    b = temp
side[2] //= temp
side[0] //= temp
print("{}/{}".format(side[0],side[2]))

lst = list(map(int, input().split()))
lst.sort()
str = input()
print("{} {} {}".format(lst[ord(str[0])-ord('A')],lst[ord(str[1])-ord('A')],lst[ord(str[2])-ord('A')]))

# 读入
isbn = list(input())
# '-'的下标位置列表
lst = [1,5,11]
# 校验和初始化
checksum = 0
# 倒着读lst，防止删除元素后导致下标变化
for i in lst[::-1]:
    del isbn[i]
# 计算校验和
for i in range(len(isbn)-1):
    checksum += int(isbn[i]) * (i + 1)
checksum %= 11
last = str(checksum)
# 求余为10则变为'X'
if last == '10':
    last = 'X'
# 校验和检测
if last == isbn[-1]:
    print("Right")
else:
    # 重新加入'-'
    for i in lst:
        isbn.insert(i,'-')
    isbn[-1]=last
    print(''.join(isbn))

n,k=map(int,input().split())
ok = []
nok = []
for i in range(1,n+1):
    if i % k == 0:
        ok.append(i)
    else:
        nok.append(i)
print("{:.1f} {:.1f}".format(sum(ok)/len(ok),sum(nok)/len(nok)))

length = int(input())
ans = 1
while length!=1:
    length //= 2
    ans += 1
print(ans)

n = int(input())
res = 1
for i in range(n,0,-1):
    for j in range(res,res+i):
        print("{:02g}".format(j),end='')
    res += i
    print("\n",end='')

n = int(input())
lst = [1]
for i in range(1,n+1):
    temp = lst[i-1] * i
    lst.append(temp)
print(sum(lst)-1)

n,x = map(int,input().split())
print(str(list(range(1,n+1))).count(str(x)))

s = input()
def isnegative(s):
    if int(s) < 0:
        return 1
if isnegative(s):
    # 去掉负号并倒序存入
    s = s[:0:-1]
    lst = list(s)
    # 删除开头的0
    if lst[0]=='0':
        del lst[0]
    # 直接int(str(lst))会报错，ValueError: invalid literal for int() with base 10
    ans = - int(''.join(map(str, lst)))
else:
    s = s[::-1]
    ans = int(s)
print(ans)

n = int(input())
f = [0,1]
for i in range(n):
    num = f[i] + f[i+1]
    f.append(num)
print("{:.2f}".format(f[n]))

# 递归方法
n = int(input())
lst = list(map(int, input().split()))
res = []
for i in range(n):
    temp = 1
    for j in range(i+1,n):
        if lst[j]==lst[j-1]+1:
            temp += 1
        else:
            break
    res.append(temp)
print(max(res))

n = int(input())
for i in range(2,int(n**1/2)+1):
    if n % i == 0:
        print(int(n/i))
        break

n = int(input())
temp = 1
for i in range(n):
    for j in range(n):
        print("{:02g}".format(temp),end='')
        temp += 1
    print()
print()
temp = 1
for i in range(n):
    for j in range(n-i-1):
        print(' '*2,end='')
    for j in range(i+1):
        print("{:02g}".format(temp),end='')
        temp += 1
    print()

n = int(input())
score = list(map(int,input().split()))
print("{:.2f}".format((sum(score)-max(score)-min(score))/(n-2)))

# 52*(7x+21k)=52*7(x+3k)
n = int(input())/(52*7)
x,k = 0,0
# x,k 为正整数; 1≤x≤100; x 尽可能大，k 尽可能小; 
for k in range(1,int(n)):
    x = n - 3*k
    if x <= 100:  break
    k += 1
print("{:.0f}\n{:d}".format(x,k))

save,mum_save = 0,0
for i in range(12):
    # 手中得到 300
    save += 300
    pay = int(input())
    # 扣除每月预计花销
    save -= pay
    # 当月余额不足，程序结束
    if (save<0):
        print("-{}".format(i+1))
        exit()
    # 预计余额超过 100，存钱
    if save >= 100:
        mum_save += save // 100
        save %= 100
save += mum_save * 120
print(save)

a,b = map(int,input().split())
# 判断是否为素数
def is_prime(num):
    for i in range(2,int(num**1/2)+1):
        if num % i == 0:
            return 0
    return 1
# 判断是否为回文数
def is_palindrome(num):
    s = str(num)
    if s == s[::-1]:
        return 1
    return 0

for i in range(a,b+1):
    if is_palindrome(i) and is_prime(i):
        print(i)

def is_prime(num):
    if num%2==0:
        return 0
    for i in range(3,int(num**1/2)+1,2):
        if num % i == 0:
            return 0
    return 1

# 埃式筛
# 核心思想：每找到一个质数，将其倍数全部删除
def get_prime(n):
  # vis 表示是否删除
    vis = [0] * (n + 1)
    vis[0]=vis[1]=0
    # 质数列表
    prime = []
    # 从小到大，找到第一个未被标记的数，就是质数
    for i in range(2,n+1):
        if vis[i]==0:
            prime.append(i)
            # 找到质数后删除其倍数
            for j in range(i+i,n+1,i):
                vis[j]=1
    return prime

L = int(input())
# 埃式筛
def get_prime(n):
    vis = [0] * (n + 1)
    vis[0]=vis[1]=0
    prime = []
    for i in range(2,n+1):
        if vis[i]==0:
            prime.append(i)
            for j in range(i+i,n+1,i):
                vis[j]=1
    return prime
prime = get_prime(L)
pack,pack_num = 0,0
for p in prime:
    pack += p
    pack_num += 1
    if pack>L:
        pack -= p
        pack_num -= 1
        break
    print(p)
print(pack_num)

n = int(input())
a = list(map(int,input().split()))
res = []
for i in range(n):
    cnt = 0
    for j in range(i):
        if a[j]<a[i]:
            cnt += 1
    res.append(cnt)
for result in res:
    print(result,end=' ')

a = list(map(int,input().split()))
for i in a[-2::-1]:
    print(i,end=' ')

n = int(input())
res = [n]
while n!=1:
    if n%2==0:
        n//=2
    else:
        n = 3*n+1
    res.append(n)
for i in res[::-1]:
    print(i,end=' ')

l, m = map(int,input().split())
# vis 记录树的存在，1 为存在，0 为不存在
vis = [1]*(l+1)
for _ in range(m):
    u, v = map(int,input().split())
    # 将区间内的树标为不存在
    for i in range(u,v+1):
        vis[i]=0
print(sum(vis))

n = int(input())
c,m,e,s=[],[],[],[]
res = 0
for i in range(n):
    chi,math,eng = map(int,input().split())
    c.append(chi)
    m.append(math)
    e.append(eng)
    s.append(chi+math+eng)
    for j in range(i):
        if abs(c[i]-c[j])<=5 and abs(m[i]-m[j])<=5 and abs(e[i]-e[j])<=5 and abs(s[i]-s[j])<=10:
            res += 1
print(res)

n = int(input())
price = list(map(int,input().split()))
# 注意还有没获奖的情况
res = [0 for _ in range(8)]
for _ in range(n):
    cnt = 0
    lst = list(map(int,input().split()))
    for i in lst:
        if i in price:
            cnt += 1
    res[7-cnt] += 1
for i in res[:-1]:
    print(i,end=' ')

w, x, h = map(int,input().split())
q = int(input())
# 初始化三维数组
vis = [[[1 for _ in range(h)]for _ in range(x)]for _ in range(w)]
for i in range(q):
    x1,y1,z1,x2,y2,z2=map(int,input().split())
    # 区域内方块被标记清除
    # 注意数组越界问题
    for i in range(x1-1,x2):
        for j in range(y1-1,y2):
            for k in range(z1-1,z2):
                vis[i][j][k]=0
# 统计剩余方块
cnt = 0
for i in range(w):
    for j in range(x):
        for k in range(h):
            if vis[i][j][k]:
                cnt += 1
print(cnt)

n = int(input())

# 幻方初始化
cube = [[0 for _ in range(n)] for _ in range(n)]
cube[0][((n+1)//2)-1] = 1
idx = [0,((n+1)//2)-1]

# 构建幻方
for i in range(2,n*n+1):
    # i-1 在第一行
    if idx[0] == 0:
        # i-1 不在最后一列
        if idx[1] != n-1:
            # 更新索引
            idx=[n-1,idx[1]+1]
        else:
            # 正下方
            idx = [1,n-1]
    elif idx[1] == n-1:
        idx = [idx[0]-1,0]
    else:
        if cube[idx[0]-1][idx[1]+1] == 0:
            idx = [idx[0]-1,idx[1]+1]
        else:
            idx = [idx[0]+1,idx[1]]
    cube[idx[0]][idx[1]] = i

# 打印幻方
for i in range(n):
    for j in range(n):
        print(cube[i][j],end=" ")
    print()

m, n = map(int,input().split())
res = [0]*10
for i in range(m, n+1):
    for j in str(i):
        res[int(j)] += 1
for ans in res:
    print(ans, end=' ')

n = int(input())
lst = list(map(int,input().split()))
lst.sort()
cnt = 0
for i in range(2,len(lst)):
    flag = False
    for j in range(i-1):
        for k in range(j+1, i):
            if lst[j] + lst[k] == lst[i]:
                cnt += 1
                flag = True
                break
        if flag:
            break
print(cnt)

n, m = map(int, input().split())
# 注意ans初始化值不能太小，考虑到lst中每个值<=100，故初始化为101*m
lst, ans = [], 101*m
for i in range(n):
    lst.append(int(input()))
# 注意range范围，莫名其妙被卡了半天
for i in range(n-m+1):
    ans = min(ans, sum(lst[i:i+m]))
print(ans)

s1, s2, s3 = map(int, input().split())
cnt = [0] * (s1+s2+s3+1)
for i in range(1,s1+1):
    for j in range(1,s2+1):
        for k in range(1,s3+1):
            cnt[i+j+k] += 1
print(cnt.index(max(cnt)))

# 模拟法
n = int(input())
# 再乘个1000就MLE了，不过这题只2e6就够了
lamp = [0] * 2000000
for _ in range(n):
    a, t = map(float,input().split())
    for i in range(1,int(t+1)):
        if lamp[int(a*i)]:
            lamp[int(a*i)] = 0
        else:
            lamp[int(a*i)] = 1
print(lamp.index(1))

# 利用异或，从开始一个灯没亮经过n次操作到只剩一个灯亮着，故每次与ans异或，到最后便为答案
# 比起上面的暴力，时间提升了40%，空间的利用也大幅降低，没有MLE的风险。
n = int(input())
ans = 0
for _ in range(n):
    a, t = map(float,input().split())
    for i in range(1,int(t+1)):
        ans ^= int(a*i)
print(ans)

n = int(input())
snake = [[0 for _ in range(n)] for _ in range(n)]
# d 代表方向：0右，1下，2左，3上
d = 0
# idx表示当前行与列的位置
idx = [0,0]
for i in range(1,n*n+1):
    snake[idx[0]][idx[1]] = i
    if d == 0:
        # 到右侧边界
        if idx[1] == n-1 or snake[idx[0]][idx[1]+1] != 0:
            d = 1
            idx[0] += 1
        else:
            idx[1] += 1
    elif d == 1:
        # 到下侧边界
        if idx[0] == n-1 or snake[idx[0]+1][idx[1]] != 0:
            d = 2
            idx[1] -= 1
        else:
            idx[0] += 1
    elif d == 2:
        # 到左侧边界
        if idx[1] == 0 or snake[idx[0]][idx[1]-1] != 0:
            d = 3
            idx[0] -= 1
        else:
            idx[1] -= 1
    else:
        # 到上侧边界
        if snake[idx[0]-1][idx[1]] != 0:
            d = 0
            idx[1] += 1
        else:
            idx[0] -= 1
for i in range(n):
    for j in range(n):
        print("{:3g}".format(snake[i][j]),end='')
    print()

n = int(input())
# 初始化一个n*n的二维数组
lst = [[0 for _ in range(n)] for _ in range(n)]
# 生成杨辉三角
for i in range(n):
    # 第一列为 1
    lst[i][0] = 1
for i in range(1,n):
    for j in range(1,i+1):
        # 除第一列，每一个位置的数都是左上+正上
        lst[i][j] = lst[i-1][j-1]+lst[i-1][j]
# 打印
for i in range(n):
    for j in range(i+1):
        print(lst[i][j], end=' ')
    print()

# 边长，火把，萤石
n, m, k = map(int,input().split())
# 生成黑暗原野，为方便后面不再判定火把和萤石光的越界，这里数组开大些
field = [[0 for _ in range(n+4)] for _ in range(n+4)]
# 插火把
lst = [-2,2]
for _ in range(m):
    x, y = map(int, input().split())
    # 点亮
    for i in range(x,x+3):
        for j in range(y,y+3):
            field[i][j] = 1
    for i in lst:
        field[x+1+i][y+1] = 1
        field[x+1][y+1+i] = 1
# 摆萤石
for _ in range(k):
    x, y = map(int, input().split())
    # 点亮
    for i in range(x-1,x+4):
        for j in range(y-1,y+4):
            field[i][j] = 1
# 生成怪物，并统计
cnt = 0
for i in range(2,n+2):
    for j in range(2,n+2):
        if field[i][j] == 0:
            cnt += 1
print(cnt)

lst = list(map(int, input().split()))
# 标记当前输出字符
key = 0
# cnt 用来统计当前字符连续输出次数， idx 是 lst 中的索引，lst[idx] 对应当前字符需要重复的次数
cnt,idx = 0,1
for i in range(lst[0]):
    for j in range(lst[0]):
        # 注意应该先判断，我之前是先输出，结果样例过了，但是测试有8个WA，一看都是开头的是1，而不是0。
        if cnt == lst[idx]:
            # 异或实现key在0与1之间的转换
            key ^= 1
            cnt = 0
            idx += 1
        print(key,end='')
        cnt += 1
    print()

# 由输入为N*N矩阵，可以从第一行输入获取N
# 习惯性的加了split()结果被卡了一会儿。
lst = list(map(int, input()))
n = len(lst)
for _ in range(n-1):
     lst.extend(list(map(int, input())))
# ans是用于输出答案的数组，ans[0]为N，后面为压缩数字；cnt用于记录当前数字出现的次数
ans = [n]
cnt = 1
# 若第一个数字为1，则向ans添加0
if lst[0]:
    ans.append(0)
for i in range(1,n*n):
    if lst[i]==lst[i-1]:
        cnt += 1
    else:
        ans.append(cnt)
        cnt = 1
ans.append(cnt)
for i in ans:
    print(i,end=' ')

# create_graph()
def create_graph():
    return [['/' for _ in range(n)] for _ in range(n)]
# input_graph()
def input_graph(lst):
    for i in range(n):
        ipt = list(input())
        for j in range(n):
            lst[i][j] = ipt[j]
    return lst
# 1.turn_90()
def turn_90(lst):
    # (x,y)->(y,n-1-x)
    res = create_graph()
    for i in range(n):
        for j in range(n):
            res[j][n-1-i] = lst[i][j]
    return res
# 2.turn_180()
def turn_180(lst):
    for _ in range(2):
        lst = turn_90(lst)
    return lst
# 3.turn_270()
def turn_270(lst):
    for _ in range(3):
        lst = turn_90(lst)
    return lst
# 4.reflect()
def reflect(lst):
    res = create_graph()
    for i in range(n):
        for j in range(n):
            res[i][n-1-j] = lst[i][j]
    return res
# 5.combain()
def combain(lst):
    lst = reflect(lst)
    lst1 = turn_90(lst)
    lst2 = turn_180(lst)
    lst3 = turn_270(lst)
    return lst1,lst2,lst3
# 6.is_same()
# determine if lst1 is same to lst2, true then return 1, else return 0.
def is_same(lst1,lst2):
    for i in range(n):
        for j in range(n):
            if lst1[i][j] != lst2[i][j]:
                return 0
    return 1
# test()
def test(lst1,lst2):
    if is_same(turn_90(lst1),lst2):
        return 1
    elif is_same(turn_180(lst1),lst2):
        return 2
    elif is_same(turn_270(lst1),lst2):
        return 3
    elif is_same(reflect(lst1),lst2):
        return 4
    elif is_same(lst1,lst2):
        return 6
    l1,l2,l3 = combain(lst1)
    if is_same(l1,lst2) or is_same(l2,lst2) or is_same(l3,lst2):
        return 5
    return 7
# begin
n = int(input())
org, ter = create_graph(), create_graph()
org, ter = input_graph(org), input_graph(ter)
print(test(org,ter))