Problem:
 Score : 100 points    Problem Statement We have a 3×3 square grid, where each square contains a lowercase English letters.
The letter in the square at the i -th row from the top and j -th column from the left is c_{ij} .  Print the string of length 3 that can be obtained by concatenating the letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.      Constraints  Input consists of lowercase English letters.         Input Input is given from Standard Input in the following format:  c_{11}c_{12}c_{13}  c_{21}c_{22}c_{23}  c_{31}c_{32}c_{33}       Output Print the string of length 3 that can be obtained by concatenating the letters on the diagonal connecting the top-left and bottom-right corner of the grid, from the top-left to bottom-right.        Sample Input 1 ant
obe
rec      Sample Output 1 abc  The letters in the squares on the diagonal connecting the top-left and bottom-right corner of the grid are a , b and c from top-right to bottom-left. Concatenate these letters and print abc .       Sample Input 2 edu
cat
ion      Sample Output 2 ean

Solution (Python):
a = input()[0]
s = input()[1]
d = input()[2]
print(a+s+d)

Solution (Python):
a = input()
b = input()
c = input() 
print(a[0] + b[1] + c[2])

Solution (Python):
n = input()
n1 = input()
n2 = input()

print(n[0],n1[1],n2[2], flush=True,sep='')

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
c1 = input()[0]
c2 = input()[1]
c3 = input()[2]
print(c1+c2+c3)

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
s = ""
for i in range(3):
  s += input()
print(s[0] + s[4] + s[8])

Solution (Python):
S1,S2,S3 = [input() for _ in range(3)]
print(S1[0]+S2[1]+S3[2])

Solution (Python):
a = [list(input()) for i in range(3)]

print(a[0][0]+a[1][1]+a[2][2])

Solution (Python):
ans = ''

for i in range(3):
   ans += input()[i]

print(ans)

Solution (Python):
n = list(input())
n1 = list(input())
n2 = list(input())

print(n[0]+n1[1]+n2[2])

Solution (Python):
l=input()[0]
l+=input()[1]
l+=input()[2]
print(l)

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
for i in range(3):
    s = input()
    print(s[i], end='')

Solution (Python):
print(input()[0],end="")
print(input()[1],end="")
print(input()[2],end="")

Solution (Python):
for i in range(3):
    a=input()
    print(a[i],end="")

Solution (Python):
c1 = str(input())
c2 = str(input())
c3 = str(input())

ans = c1[0] + c2[1] + c3[2]
print(ans)

Solution (Python):
r1 = input()
r2 = input()
r3 = input()
ans = r1[0] + r2[1] + r3[2]
print(ans)

Solution (Python):
c1 = str(input())
c2 = str(input())
c3 = input()
print(c1[0]+c2[1]+c3[2])

Solution (Python):
import sys
s = sys.stdin.read().split()
print(s[0][0] + s[1][1] + s[2][2])

Solution (Python):
ans = []
for i in range(3):
  c = input()
  ans.append(c[i])
print("".join(ans))

Solution (Python):
a,b,c=input(),input(),input()
print(a[0]+b[1]+c[2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0] + b[1] + c[2])

Solution (Python):
a = list(input())
b = list(input())
c = list(input())

print(a[0] + b[1] + c[2])

Solution (Python):

import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect
import copy
import math
from itertools import accumulate
sys.setrecursionlimit(10**6)




def floor(a, b): return -(-a // b)


def zz(): return list(map(int, sys.stdin.readline().split()))


def z(): return int(sys.stdin.readline())


def S(): return sys.stdin.readline()[:-1]


def C(line): return [sys.stdin.readline() for _ in range(line)]


S = C(3)
print(S[0][0], S[1][1], S[2][2], sep='')

Solution (Python):
c=[input() for _ in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()

print(c1[0] + c2[1] + c3[2])

Solution (Python):
print(input()[0] + input()[1] + input()[2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
ans = ""
for i in range(3):
  x = input()
  ans += x[i]
print(ans)

Solution (Python):
a = input()
b = input()
c = input()
print(a[0] + b[1] + c[2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
A = []
for i in range(3):
    A.append(input())
print(A[0][0]+A[1][1]+A[2][2])

Solution (Python):
A = list(input())
B = list(input())
C = list(input())

print(f"{A[0]}{B[1]}{C[2]}")

Solution (Python):
a = input()
b = input()
c = input()

print(a[0] + b[1] + c[2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0] + b[1] + c[2])

Solution (Python):
a = map(str, input().split())
line_a = ''.join(a)

b = map(str, input().split())
line_b = ''.join(b)

c = map(str, input().split())
line_c = ''.join(c)

print('{}{}{}'.format(line_a[0], line_b[1], line_c[2]))

Solution (Python):
a = input()[0]
b = input()[1]
c = input()[2]
print(a+b+c)

Solution (Python):
a=[input() for _ in range(3)]
print(a[0][0]+a[1][1]+a[2][2])

Solution (Python):
def main():
    c_list = [list(input()) for _ in range(3)]
    print(c_list[0][0] + c_list[1][1] + c_list[2][2])


if __name__ == "__main__":
    main()

Solution (Python):



c1 = str(input())
c2 = str(input())
c3 = str(input())


print(c1[0]+c2[1]+c3[2])

Solution (Python):
str1 = input()
str2 = input()
str3 = input()

print(str1[0]+str2[1]+str3[2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    res = ""

    for i in range(3):
        s = input()
        res += s[i]

    print(res)


if __name__ == '__main__':
    main()

Solution (Python):
c = [input() for _ in range(3)]
for i in range(3):
    print(c[i][i], end="")

Solution (Python):
cij = [list(input()) for _ in range(3)]

print(cij[0][0] + cij[1][1] + cij[2][2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
print(''.join([input()[i] for i in range(3)]))

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
import sys
C = sys.stdin.readlines()
print(C[0][0]+C[1][1]+C[2][2])

Solution (Python):

c1=list(map(str,input()))
c2=list(map(str,input()))
c3=list(map(str,input()))
print(c1[0]+c2[1]+c3[2])

Solution (Python):
S=input()
T=input()
U=input()
print(S[0]+T[1]+U[2])

Solution (Python):
x = [input() for i in range(3)]
print(x[0][0]+x[1][1]+x[2][2])

Solution (Python):
res = ""
for i in range(3):
    line = input()
    res += line[i]

print(res)

Solution (Python):
S = [input() for i in range(3)]
print(S[0][0]+S[1][1]+S[2][2])

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
c=[input() for _ in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
c = [input() for _ in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
a = [input() for _ in range(3)]
print(a[0][0] + a[1][1] + a[2][2])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()
print("".join(c1[0]+c2[1]+c3[2]))

Solution (Python):
S = [input() for _ in range(3)]
print(S[0][0]+S[1][1]+S[2][2])

Solution (Python):
C = [input() for _ in range(3)]
print(C[0][0] + C[1][1] + C[2][2])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()
print(c1[0]+c2[1]+c3[2])

Solution (Python):
def resolve():
    matrix = []
    for i in range(3):
        line = input()
        matrix.append(line)
    ans = ""
    for i in range(3):
        ans += matrix[i][i]
    print(ans)
resolve()

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])

Solution (Python):
l=[]
for i in range(3):
    l.append(input())
r=''
for i in range(3):
    r+=l[i][i]
print(r)

Solution (Python):
c_lst = [str(input()) for _ in range(3)]
ans = ''
for i in range(3):
    ans += c_lst[i][i]
print(ans)

Solution (Python):
c = [str(input()) for i in range(3)]
w = c[0][0]+c[1][1]+c[2][2]
print(w)

Solution (Python):
c = []
for i in range(3):
    c.append(list(input()))
print(''.join([c[0][0],c[1][1],c[2][2]]))

Solution (Python):
ans = ""
for i in range(3):
    ans += input()[i]
else:
    print(ans)

Solution (Python):
a = input()
b = input()
c = input()
print(a[0] + b[1] + c[2])

Solution (Python):
c = [input() for _ in range(3)]
print(c[0][0]+ c[1][1]+c[2][2])

Solution (Python):
c1=input()
c2=input()
c3=input()
print(c1[0],end="")
print(c2[1],end="")
print(c3[2])

Solution (Python):
c1=str(input())
c2=str(input())
c3=str(input())

print(c1[0]+c2[1]+c3[2])

Solution (Python):
N_list = []

for i in range(3):
    N = input()
    N_i = N[0:3]
    N_list.append(N_i)
    i += 1
    
print(N_list[0][0] + N_list[1][1] + N_list[2][2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
A=input()
S=input()
D=input()
print(A[0]+S[1]+D[2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
c = []
for i in range(3):
  c += [input()]
  
print(c[0][0] + c[1][1]  + c[2][2])

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
c = [list(input()) for i in range(3)]

print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
s = input()
t = input()
u = input()
print(s[0]+t[1]+u[2])

Solution (Python):
ans = ''
ans += input()[0]
ans += input()[1]
ans += input()[2]
print(ans)

Solution (Python):
c1 = list(input())
c2 = list(input())
c3 = list(input())

print(c1[0]+c2[1]+c3[2])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()

print(c1[0]+c2[1]+c3[2])

Solution (Python):
S1 = input()
S2 = input()
S3 = input()
print(S1[0] + S2[1] + S3[2])

Solution (Python):
x=[input() for _ in range(3)]
for i in range(3):
    print(x[i][i],end="")

Solution (Python):
a = str(input())
b = str(input())
c = str(input())
print(a[0]+b[1]+c[2])

Solution (Python):
print(''.join([input()[i] for i in range(3)]))

Solution (Python):
[print(input()[i],end='') for i in range(3)]

Solution (Python):
print(*[input()[i] for i in range(3)],sep='')

Solution (Python):
c = []

for i in range(3):
    tmp = input()
    c.append(tmp)

ans = ""
for i in range(3):
    ans += c[i][i]

print(ans)

Solution (Python):
l1 = input ()
l2 = input ()
l3 = input ()
print (l1[0]+l2[1]+l3[2])

Solution (Python):
ls = []
for i in range(3):
  ls.append(input())
ans = ''
for i in range(3):
  ans += ls[i][i]
print(ans)

Solution (Python):
r1 = list(input())
r2 = list(input())
r3 = list(input())

print(r1[0]+r2[1]+r3[2])

Solution (Python):









c1 = input()
c2 = input()
c3 = input()

print(c1[0]+c2[1]+c3[2])

Solution (Python):
c1=str(input())
c2=str(input())
c3=str(input())
print(c1[0]+c2[1]+c3[2])

Solution (Python):
i1=input()
i2=input()
i3=input()
print(str(i1[0])+str(i2[1])+str(i3[2]))

Solution (Python):

def main():
    c = [input() for _ in range(3)]
    print(c[0][0] + c[1][1] + c[2][2])


if __name__ == "__main__":
    main()

Solution (Python):
a,b,c = [input() for i in range(3)]
print(a[0]+b[1]+c[2])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()
print(c1[0]+c2[1]+c3[2])

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    C = [readline().strip() for _ in range(3)]

    print(C[0][0] + C[1][1] + C[2][2])

    return


if __name__ == '__main__':
    main()

Solution (Python):
x= input()
y=input()
z=input()
result=x[0]+y[1]+z[2]
print(result)

Solution (Python):
c1 = str(input())
c2 = str(input())
c3 = str(input())
print(c1[0] + c2[1] + c3[2])

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    C = read().split()
    ans = ''
    for i in range(3):
        ans += C[i][i]
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
s = [list(input()) for _ in range(3)]

print(s[0][0]+s[1][1]+s[2][2])

Solution (Python):
A=input()
B = input()
C = input()
print(A[0] + B[1] + C[2])

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    c = [SS() for _ in range(3)]

    ans = ''.join(c[i][i] for i in range(3))
    print(ans)

if __name__ == '__main__':
    resolve()

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
ans = ''
for i in range(3):
    s = input()
    ans += s[i]
print(ans)

Solution (Python):
c=input()
d=input()
e=input()
ans=c[0]+d[1]+e[2]
print(ans)

Solution (Python):
C = [input() for i in range(3)]
print(C[0][0]+C[1][1]+C[2][2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
C = [[''] * 3 for _ in range(3)]
for i in range(3):
    C[i] = list(str(input()))

print(''.join((C[0][0], C[1][1], C[2][2])))

Solution (Python):
c1=input()[0]
c2=input()[1]
c3=input()[2]
print(c1+c2+c3)

Solution (Python):
c1=input()[0]
c2=input()[1]
c3=input()[2]
print(c1+c2+c3)

Solution (Python):
a = [list(map(str, input())) for i in range(3)]
my_result = a[0][0] + a[1][1] + a[2][2]
print(my_result)

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

ans = ""
for i in range(3):
    s = input()
    ans += s[i]
print(ans)

Solution (Python):
a = [raw_input() for _ in range(3)]
print ''.join([a[i][i] for i in range(3)])

Solution (Python):
C = [input() for _ in range(3)]

print(C[0][0] + C[1][1] + C[2][2])

Solution (Python):
a=input()
print(a[0],end="")
a=input()
print(a[1],end="")
a=input()
print(a[2],end="")

Solution (Python):
print(input()[0],end='')
print(input()[1],end='')
print(input()[2])

Solution (Python):
a = input()
b = input()
c = input()

print(a[0] + b[1] + c[2])

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
S = [list(input()) for i in range(3)]

print("".join([S[0][0],S[1][1],S[2][2]]))

Solution (Python):
ss = open(0).read().splitlines()

ans = ''
for i,s in enumerate(ss):
    ans += s[i]
print(ans)

Solution (Python):
print(open(0).read()[0::5])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()

ans = ''
ans += c1[0]
ans += c2[1]
ans += c3[2]
print(ans)

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
print(''.join([ input()[i] for i in range(3) ]))

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    s1 = s_input()
    s2 = s_input()
    s3 = s_input()

    print(s1[0] + s2[1] + s3[2])

if __name__ == '__main__':
    main()

Solution (Python):
s = ""
s += input()[0]
s += input()[1]
s += input()[2]
print(s)

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    C = [input().strip("\n") for _ in range(3)]
    print(C[0][0] + C[1][1] + C[2][2])

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
print(''.join([ input()[i] for i in range(3) ]))

Solution (Python):
c = [input() for _ in range(3)]
print(c[0][0] + c[1][1] + c[2][2])

Solution (Python):
Str = [input()[I] for I in range(0,3)]
print(''.join(Str))

Solution (Python):
C = [input() for _ in range(3)]
print(C[0][0]+C[1][1]+C[2][2])

Solution (Python):
C=[input() for _ in range(3)]
print(''.join([C[i][i] for i in range(3)]))

Solution (Python):
c1 = list(input())
c2 = list(input())
c3 = list(input())

print(c1[0]+c2[1]+c3[2])

Solution (Python):
a = [input() for _ in range(3)]
print(a[0][0], a[1][1], a[2][2], sep='')

Solution (Python):
l1=list(input())
l2=list(input())
l3=list(input())
print(l1[0]+l2[1]+l3[2])

Solution (Python):
s1=input()[0]
s2=input()[1]
s3=input()[2]
print(s1+s2+s3)

Solution (Python):
a = input()
b = input()
c = input()
print(a[0] + b[1] + c[2])

Solution (Python):
s = input()
a = input()
c = input()
print(s[0]+a[1]+c[2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
ans = ""
for i in range(3):
    s = input()
    ans += s[i]

print(ans)

Solution (Python):
c1 = input()
c2 = input()
c3 = input()

print(c1[0]+c2[1]+c3[2])

Solution (Python):
def solve():
    a = input()[0]
    b = input()[1]
    c = input()[2]
    print(a+b+c)



if __name__ == "__main__":
    solve()

Solution (Python):
c1 = list(input())
c2 = list(input())
c3 = list(input())
print(c1[0]+c2[1]+c3[2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
ans = ''
for i in range(3):
    s = str(input())
    ans += s[i]
print(ans)

Solution (Python):
l = [input() for i in range(3)]
print(l[0][0] + l[1][1] + l[2][2])

Solution (Python):
a=input()+input()+input();print(a[::4])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()
print(c1[0] + c2[1] + c3[2])

Solution (Python):
a = input()
b=input()
c=input()
res = a[0] + b[1] + c[2]
print(res)

Solution (Python):
def main():
 a = input()
 b = input()
 c = input()
 print(a[0] + b[1] + c[2])
main()

Solution (Python):
c1=input()
c2=input()
c3=input()
print(c1[0]+c2[1]+c3[2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
S=input()
T=input()
U=input()
print(S[0]+T[1]+U[2])

Solution (Python):
a, b,c = [input() for i in range(3)]
print(a[0], b[1],c[2],sep="")

Solution (Python):
c11,c12,c13 = input()
c21,c22,c23 = input()
c31,c32,c33 = input()

print(c11+c22+c33)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    C = [input() for _ in range(3)]
    ans = C[0][0] + C[1][1] + C[2][2]
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
ans = ""
for i in range(3):
    c = input()
    ans += c[i]
print(ans)

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
S = [input() for _ in range(3)]
print(S[0][0]+S[1][1]+S[2][2])

Solution (Python):
S = [input() for _ in range(3)]
print(S[0][0]+S[1][1]+S[2][2])

Solution (Python):
c = ''
for i in range(3):
    c += input()[i]

print(c)

Solution (Python):
print('{}{}{}'.format(input()[0],input()[1],input()[2]))

Solution (Python):
line1 = list(input())
line2 = list(input())
line3 = list(input())
print(line1[0] + line2[1] + line3[2])

Solution (Python):
C1 = input()
C2 = input()
C3 = input()

print(C1[0]+C2[1]+C3[2])

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

s = []
for i in range(3):
  s.append(input())

for i in range(3):
  print(s[i][i],end="")

Solution (Python):
S = [input() for _ in range(3)]
print(S[0][0]+S[1][1]+S[2][2])

Solution (Python):
a = input()
b = input()
c = input()

print(a[0]+b[1]+c[2])

Solution (Python):
c = [input() for _ in range(3)]
for i in range(3):
  print(c[i][i],end="")

Solution (Python):
C1=str(input())
C2=str(input())
C3=str(input())

print(C1[0]+C2[1]+C3[2])

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
c = [input() for _ in range(3)]
print('{}{}{}'.format(c[0][0], c[1][1], c[2][2]))

Solution (Python):
a = input()
b = input()
c = input()
print(a[0] + b[1] + c[2])

Solution (Python):
res = ''
for i in range(3):
    c = input()
    res += c[i]
print(res)

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b, c = rr(), rr(), rr()
print(a[0] + b[1] + c[-1])

Solution (Python):
c = [list(input()) for _ in range(3)]
for i in range(3):
    print(c[i][i], end='')

Solution (Python):
a = []
for i in range(3):
  a.append(input())
ans = ""
for i in range(3):
  ans += a[i][i]

print(ans)

Solution (Python):
a =input()
b =input()
c =input()

d = a[0]+b[1]+c[2]

print(d)

Solution (Python):

s1 = input()
s2 = input()
s3 = input()
print(s1[0]+s2[1]+s3[2])

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
a = str(input())
b = str(input())
c = str(input())

print(a[0] +b[1]+c[2])

Solution (Python):
a = input()
b = input()
c = input()

x = a[0] + b[1] + c[2]
print(''.join(x))

Solution (Python):




c1=input()
c2=input()
c3=input()
print(c1[0]+c2[1]+c3[2])

Solution (Python):
s = [list(input()) for i in range(3)]
print(s[0][0]+s[1][1]+s[2][2])

Solution (Python):
import sys
array_list = []
for I in range(3):
    array_list.append([lista for lista in input()])
print(str(array_list[0][0])+str(array_list[1][1])+str(array_list[2][2]))

Solution (Python):

C = [list(input()) for n in range(3)]


res = "".join([C[n][n] for n in range(3)])
print(res)

Solution (Python):
C1,C2,C3 = map(str, [input() for i in range(3)])

ans = C1[0]+C2[1]+C3[2]
print(ans)

Solution (Python):
c_list=[]
for i in range(3):
    c_list.append(input())
    
print(c_list[0][0]+c_list[1][1]+c_list[2][2])

Solution (Python):

U=input()
M=input()
B=input()

print(U[0]+M[1]+B[2])

Solution (Python):
i = [list(input()) for i in range(3)]
print(i[0][0]+i[1][1]+i[2][2])

Solution (Python):
a = str(input())
b = str(input())
c = str(input())
x = a[0]+b[1]+c[2]
print(x)

Solution (Python):
a=input();b=input();c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
x = input()[0]
y = input()[1]
z = input()[2]
print(x + y + z)

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
a=input()
b=input()
c=input()
lst=[a[0],b[1],c[2]]
print("".join(lst))

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
a = []
for i in range(3):
  a.append(input())
print(a[0][0]+a[1][1]+a[2][2])

Solution (Python):
c = list(input())
cc = list(input())
ccc = list(input())
print(c[0] + cc[1] + ccc[2])

Solution (Python):
print(open(0).read()[::5])

Solution (Python):
c = [0]*3
for i in range(3):
	c[i] = input()
L = []
for i in range(3):
	b = list(c[i])
	L.append(b[i])
print(''.join(L))

Solution (Python):
S=input()
T=input()
U=input()
A=[S[0],T[1],U[2]]
print(S[0]+T[1]+U[2])

Solution (Python):
A = input()
B = input()
C = input()

print(A[0]+B[1]+C[2])

Solution (Python):
k = []
for i in range(3):
    l = list(input())
    k.append(l)
s = ''
for i in range(3):
    s += k[i][i]
print(s)

Solution (Python):
C1 = input()
C2 = input()
C3 = input()

c11 = C1[0]
c22 = C2[1]
c33 = C3[2]

C = c11 + c22 + c33

print(C)

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

s1 = s()
s2 = s()
s3 = s()
print(s1[0]+s2[1]+s3[2])

Solution (Python):
c1=input()
c2=input()
c3=input()
print(c1[0]+c2[1]+c3[2])

Solution (Python):


c1 = str(input())
c2 = str(input())
c3 = str(input())

print(c1[0], c2[1], c3[2], sep='')

Solution (Python):
c1 = input()
c2 = input()
c3 = input()
print('{}{}{}'.format(c1[0],c2[1],c3[2]))

Solution (Python):
c = [input() for i in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
a = list(input())
b = list(input())
c = list(input())
res = a[0] + b[1] + c[2]
print("".join(res))

Solution (Python):

C = [list(input()) for i in range(3)]


print(C[0][0] + C[1][1] + C[2][2])

Solution (Python):
c1 = input()[0]
c2 = input()[1]
c3 = input()[2]
print(c1+c2+c3)

Solution (Python):
A,B,C = (input() for i in range(3))
print(A[0]+B[1]+C[2])

Solution (Python):
def main():
    A = list(str(input()))
    B = list(str(input()))
    C = list(str(input()))
    print(A[0] + B[1] + C[2])
main()

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    c1 = input().rstrip()
    c2 = input().rstrip()
    c3 = input().rstrip()

    ans = c1[0] + c2[1] + c3[2]

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
c = [list(input()) for i in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):

import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

C = np.array([list(sr()) for _ in range(3)])
answer = np.diag(C)
print(''.join(answer.astype(str)))

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

C = [sr() for _ in range(3)]
answer = ''
for i in range(3):
    answer += C[i][i]

print(answer)

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
c = input()
d = input()
e = input()
ans = c[0] + d[1] + e[2]
print(ans)

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
a = []
for _ in range(3):
  A = input()
  a.append(A)
print(a[0][0] + a[1][1] + a[2][2])

Solution (Python):
print(input()[0]+input()[1]+input()[2])

Solution (Python):
ans = ''

for i in range(3):
    tmps = input()
    ans += tmps[i]

print(ans)

Solution (Python):
c = [list(input()) for _ in range(3)]
print(c[0][0] + c[1][1] + c[2][2])

Solution (Python):
print(open(0).read()[::5])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
a = list(input())
b = list(input())
c = list(input())

print(a[0] + b[1] + c[2])

Solution (Python):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left 
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

C = [list(input()) for _ in range(3)]
print(C[0][0]+C[1][1]+C[2][2])

Solution (Python):
ans = ""
ans += input()[0]
ans += input()[1]
ans += input()[2]
print (ans)

Solution (Python):
def main():
    C = list(input() for i in range(3))

    print(C[0][0] + C[1][1] + C[2][2])

if __name__ == '__main__':
    main()

Solution (Python):
ans=""
for i in range(3):
  s=input()
  ans+=s[i]
print(ans)

Solution (Python):
import sys
readline = sys.stdin.readline

ans = ""
for i in range(3):
  ans += readline().strip()[i]
  
print(ans)

Solution (Python):
c = [list(input())[i] for i in range(3)]
print("".join(c))

Solution (Python):
ans=[]
a=input()
ans.append(a[0])
a=input()
ans.append(a[1])
a=input()
ans.append(a[2])
print(''.join(ans))

Solution (Python):
a = str(input())
b = str(input())
c = str(input())
print(a[0] + b[1] + c[2])

Solution (Python):
c1 = list(input())
c2 = list(input())
c3 = list(input())

ans = c1[0]+c2[1]+c3[2]
print(ans)

Solution (Python):
a,b,c=input(),input(),input();print(a[0]+b[1]+c[2])

Solution (Python):
c = [input() for _ in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
c1=input()
c2=input()
c3=input()

print(c1[0]+c2[1]+c3[2])

Solution (Python):
c = [input() for i in range(3)]
print(c[0][0] + c[1][1] + c[2][2])

Solution (Python):
c=[input() for i in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
def actual(C):
    return C[0][0] + C[1][1] + C[2][2]
    

C = []
C.append(input())
C.append(input())
C.append(input())

print(actual(C))

Solution (Python):
a = input()
b = input()
c = input()
print(a[0]+b[1]+c[2])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()

print(c1[0]+c2[1]+c3[2])

Solution (Python):
c0,c1,c2=[input() for i in range(3)]
print(c0[0]+c1[1]+c2[2])

Solution (Python):
a = []
for i in range(3):
    a.append(input())
print("{}{}{}".format(a[0][0],a[1][1],a[2][2]))

Solution (Python):
a = [input() for x in range(3)]
print(a[0][0] + a[1][1] + a[2][2])

Solution (Python):
a = input()
b = input()
c = input()
print(a[0] + b[1] + c[2])

Solution (Python):
a = input()
b = input()
c = input()

print(a[0] + b[1] + c[2])

Solution (Python):
c1 = str(input())
c2 = str(input())
c3 = str(input())
print(c1[0], c2[1], c3[2], sep = "")

Solution (Python):
s1 = str(input())
s2 = str(input())
s3 = str(input())

print(s1[0] + s2[1] + s3[2])

Solution (Python):
[print(input()[i],end='') for i in range(3)]

Solution (Python):
c = [input() for _ in range(3)]
print(c[0][0]+c[1][1]+c[2][2])

Solution (Python):
c = input()
d = input()
e = input()
print(c[0]+d[1]+e[2])

Solution (Python):
C1,C2,C3 = open(0).read().split()

print(C1[0]+C2[1]+C3[2])

Solution (Python):
c = [input() for _ in range(3)]
print(c[0][0] + c[1][1] + c[2][2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
c1 = input()
c2 = input()
c3 = input()
print(c1[0] + c2[1] + c3[2])

Solution (Python):
c = [input() for i in range(3)]
print(c[0][0] + c[1][1] + c[2][2])

Solution (Python):
s = "".join([input() for _ in range(3)])
print(s[0] + s[4] + s[8])

Solution (Python):
c1=input()
c2=input()
c3=input()

print(c1[0]+c2[1]+c3[2])

Solution (Python):
c = [input() for _ in range(3)]

print(c[0][0] + c[1][1] + c[2][2])

Solution (Python):
def main():
  c = [input() for _ in range(3)]
  print(c[0][0] + c[1][1] + c[2][2])
if __name__ == '__main__':
  main()

Solution (Python):
c1=input()
c2=input()
c3=input()

print(c1[0]+c2[1]+c3[2])

Solution (Python):
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Solution (Python):
c = [input() for _ in range(3)]
print(c[0][0]+c[1][1]+c[2][2])