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



Sample input:
ant
obe
rec


Sample output:
abc

Submission status: Accepted

Solution code:
def examA():
    C = [SI()for _ in range(3)]
    ans = C[0][0]+C[1][1]+C[2][2]
    print(ans)
    return

def examB():
    N, M = LI()
    P = [0]*N
    S = [LSI()for _ in range(M)]
    pena = 0
    ac = set()
    for p,s in S:
        p = int(p)-1
        if s=="WA":
            P[p] += 1
        else:
            if p in ac:
                continue
            ac.add(p)
            pena += P[p]

    print(len(ac),pena)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(readline())
def LI(): return list(map(int,readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
#%%code
def resolve():
    ans=""
    for i in range(3):
        ans+=input()[i]
    print(ans)
#%%submit!
resolve()

Submission status: Accepted

Solution code:
def solve():

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



if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A = [input() for i in range(3)]
    print(A[0][0]+A[1][1]+A[2][2])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    grid = [input() for _ in range(3)]
    for i in range(3):
        print(grid[i][i], end="")
    print()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC090A

c1 = input()
c2 = input()
c3 = input()
print(''.join((c1[0], c2[1], c3[2])))

Submission status: Accepted

Solution code:
line1 = input()
line2 = input()
line3 = input()

print(line1[0],line2[1],line3[2],sep='')

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = input()
c = input()
print("{}{}{}".format(a[0], b[1], c[2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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, groupby
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
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

c = [input() for _ in range(3)]
print(c[0][0], end ="")
print(c[1][1], end ="")
print(c[2][2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = [input() for i in range(3)]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    ans = ''
    for i in range(3):
        ans += input()[i]
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    mat = [list(input()) for i in range(3)]
    print(mat[0][0]+mat[1][1]+mat[2][2])
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
C = [input() for i in range(3)]
print(''.join([C[0][0], C[1][1], C[2][2]]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C1 = list(input())
C2 = list(input())
C3 = list(input())
print(C1[0]+C2[1]+C3[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = [input() for _ in range(3)]
ans = [c[i][i] for i in range(3)]
print(''.join(ans))

Submission status: Accepted

Solution code:
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))
## dp
INIT_VAL = 0
DP2 = lambda d1, d2: [[INIT_VAL]*d2 for _ in range(d1)]
DP3 = lambda d1, d2, d3: [[[INIT_VAL]*d3 for _ in range(d2)] for _ in range(d1)]

def main():
    res = ''
    for i in range(3): res += IS()[i]
    print(res)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
answer_list=[]
S=input()
answer_list.append(S[0])
S=input()
answer_list.append(S[1])
S=input()
answer_list.append(S[2])

print("".join(answer_list))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()[0]
b = input()[1]
c = input()[2]

print(a+b+c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=list(input())
b=list(input())
c=list(input())
print("{}{}{}".format(a[0],b[1],c[2]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
try:
    from typing import List
except ImportError:
    pass


def solve(c: "List[str]"):
    print("".join(c[i][i] for i in range(3)))


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    c = [next(tokens) for _ in range(3)]  # type: "List[str]"
    solve(c)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
a,b,c=map(str,input())
d,e,f=map(str,input())
g,h,i=map(str,input())
print(a+e+i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
s3 = input()

ans = []

ans.append(s1[0])
ans.append(s2[1])
ans.append(s3[2])

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=[]
for i in range(3):
    a.append(input())

b=""
for i in range(3):
    w=a[i]
    b+=w[i]
    
print(b)

Submission status: Accepted

Solution code:
ans = []
for i in range(3):
    a = list(input())
    ans.append(a[i])
print("".join(ans))

Submission status: Accepted

Solution code:
n = input()
m = input()
k = input()
ans = n[0] + m[1] + k[2]
print(ans)

Submission status: Accepted

Solution code:
s=[input() for _ in range(3)]
ans=s[0][0]+s[1][1]+s[2][2]
print(ans)

Submission status: Accepted

Solution code:
url = "https://atcoder.jp/contests/abc090/tasks/abc090_a"

def main():
    for i in range(3):
        t = input()
        print(t[i], end="")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
L = list(input() for _ in range(3))
res = []
for i in range(3):
    res.append(L[i][i])
print("".join(res))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
c1, c2, c3 = open(0).read().split()
print(c1[0]+c2[1]+c3[2])

Submission status: Accepted

Solution code:
s=open(0).read()
print(s[0]+s[5]+s[10])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

d=[a[0],b[1],c[2]]
print("".join(d))

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
ans = ''

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

print(ans)

Submission status: Accepted

Solution code:

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

print("".join(ans))

Submission status: Accepted

Solution code:
a = input()[0]
b = input()[1]
c = input()[2]

ans = a + b + c
print (ans)

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
C = list(input() for i in range(3))

S=''
for i in range(3):
  S=S+C[i][i]
  
print(S)

Submission status: Accepted

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

Submission status: Accepted

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

print(c1[0], end="")
print(c2[1], end="")
print(c3[2], end="")

Submission status: Accepted

Solution code:

a = input()
b = input()
c = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
A = input()
B = input()
C = input()
print(A[0] + B[1] + C[2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
List = [input() for _ in range(3)]
for i in range(3):
    print(List[i][i],end="")
print("\n",end="")

Submission status: Accepted

Solution code:
import itertools
def main():
  a = []
  for i in range(3):
    s = input()
    a.append(s[i])
  print('{}{}{}'.format(a[0],a[1],a[2]))
if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=[input()[i] for i in range(3)]
print("".join(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s = sys.stdin.read().split()

def main():
    t = ''
    for i in range(3): t += s[i][i]
    print(t)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 090: A – Diagonal String
c = [input() for _ in range(3)]
print(c[0][0] + c[1][1] + c[2][2])

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
A = input()
B = input()
C = input()
print("" + A[0] + B[1] + C[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = input()
    b = input()
    c = input()

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

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
c = list(input())
print(a[0], b[1], c[2], sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = input(), input(), input()
print('{}{}{}'.format(a[0], b[1], c[2]));

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = input()
H = input()
K = input()
print((N[0])+(H[1])+(K[2]))

Submission status: Accepted

Solution code:
A,B,C= map(str,input())
D,E,F= map(str,input())
G,H,I= map(str,input())
print(A+E+I)

Submission status: Accepted

Solution code:
import numpy as np
c = ''
for i in range(3):
  c += input()
print(c[0] + c[4] + c[8])

Submission status: Accepted

Solution code:
D = input
print(D()[0]+D()[1]+D()[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ans = []
for i in range(3):
  ans.append(input()[i])
ans = ''.join(ans)
print(ans)

#print(*ans, sep='\n')

Submission status: Accepted

Solution code:
import math



a=input()
b=input()
c=input()

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

Submission status: Accepted

Solution code:
A, B, C = input()
D, E, F = input()
G, H, I = input()
print(A,E,I,sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    c1 = list(input())
    c2 = list(input())
    c3 = list(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
c = [input() for _ in range(3)]
print(''.join(c[0][0]+c[1][1]+c[2][2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
y = input()
z = input()
a = x + y + z
print(a[0::4])

Submission status: Accepted

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

print(a[0],end="")
print(b[1],end="")
print(c[2])

Submission status: Accepted

Solution code:
# | Its_Rashid | #
a = [input() for i in range(3)]
print(a[0][0] + a[1][1] + a[2][2])

Submission status: Accepted

Solution code:
s = [input() for i in range(3)]
print(s[0][0], s[1][1], s[2][2], sep='')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
s3 = input()

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

Submission status: Accepted

Solution code:
def Diagonal_String(c1, c2, c3):

    return c1[0] + c2[1] + c3[2]

def main():
    c1 = str(input())
    c2 = str(input())
    c3 = str(input())
    print(Diagonal_String(c1 , c2 , c3))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
css = [input().rstrip() for _ in range(3)]

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
c=[str(i) for i in open(0)]
ans=c[0][0]+c[1][1]+c[2][2]
print(ans)

Submission status: Accepted

Solution code:
#abc090 a
c=[]
for i in range(3):
    line=input()
    c.append(line)
print(c[0][0]+c[1][1]+c[2][2])

Submission status: Accepted

Solution code:
c1 = [""] * 3
c2 = [""] * 3
c3 = [""] * 3
for i in range(3):
  c1[i],c2[i],c3[i] = list(str(input()))
ans = ""
ans += c1[0]
ans += c2[1]
ans += c3[2]
print(ans)

Submission status: Accepted

Solution code:
#pypyは内包表記使わない
def main():
    import sys
    #input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations
    #from itertools import accumulate, product
    from bisect import bisect_left,bisect_right
    from math import floor, ceil
    #from operator import itemgetter

    #mod = 1000000007

    a = input().rstrip()
    b = input().rstrip()
    c = input().rstrip()
    print(a[0]+b[1]+c[2])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Thu Mar 12 19:34:40 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

m = nsn(3)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=input()
B=input()
C=input()
print(A[0],end="")
print(B[1],end="")
print(C[2])

Submission status: Accepted

Solution code:
tmp = 0
s = ""
for i in range(3):
    a = input()
    s += a[tmp]
    tmp += 1
print(s)

Submission status: Accepted

Solution code:
A, B, C = [input() for i in range(3)]

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

c = [STR() for _ in range(3)]
print(c[0][0] + c[1][1] + c[2][2])

Submission status: Accepted

Solution code:
s = input()
s1 = input()
s2 = input()
print(s[0]+s1[1]+s2[2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# A - Diagonal String
a=input()
b=input()
c=input()
print(a[0]+b[1]+c[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = []
for _ in range(3):
    c.append(input())

print(c[0][0],c[1][1],c[2][2], sep="")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = input()
c = input()
print(a[0],b[1],c[2],sep="")

Submission status: Accepted

Solution code:
result=""
for i in range(3):
  temp=input()
  result+=temp[i]
print(result)

Submission status: Accepted

Solution code:
dat =[]
dat.append(input())
dat.append(input())
dat.append(input())
print(dat[0][0] + dat[1][1] + dat[2][2])

Submission status: Accepted

Solution code:
c = []
for i in range(3):
    c.append(input())

for i in range(3):
    for j in range(3):
        if i == j:
            print(c[i][j],end="")
print()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
L  = []
for i in range(3):
    L.append(input())

ans = ''
for i in range(3):
    ans += L[i][i]
    
print(ans)

Submission status: Accepted

Solution code:
import sys
a = [[str(i) for i in l.strip()] for l in sys.stdin]
print(a[0][0]+a[1][1]+a[2][2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [input() for _ in range(3)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#090_A
c=''
for i in range(3):
    c+=input()[i]
print(c)

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = [input() for _ in range(3)]
print(c[0][0],end = '')
print(c[1][1],end = '')
print(c[2][2])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

S_list = [input().strip() for _ in range(3)]

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

Submission status: Accepted

Solution code:
s=[ input() for _ in range(3)]
#print(s)
ss=s[0][0]+s[1][1]+s[2][2]
print(ss)

Submission status: Accepted

Solution code:
a = list(map(str, input()))
b = list(map(str, input()))
c = list(map(str, input()))

print(a[0]+b[1]+c[2], end='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

A=np.array([list(input()) for i in range(3)])
for i in range(3):
    print(np.diag(A)[i],end='')

Submission status: Accepted

Solution code:
a = raw_input()
b = raw_input()
c = raw_input()
print a[0]+b[1]+c[2]

Submission status: Accepted

Solution code:
a=raw_input()
b=raw_input()
c=raw_input()
print a[0]+b[1]+c[2]

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = ""
for n in range(3):
  t += input()[n]
print(t)

Submission status: Accepted

Solution code:
Strings = [input() for i in range(3)]

output = ''
for n, s in enumerate(Strings):
    output += s[n]
    
print(output)

Submission status: Accepted

Solution code:
c1 = []
c2 = []
c3 = []

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

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

Submission status: Accepted

Solution code:
print("".join(input()[i] for i in range(3)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c1,c2,c3 = [input() for _ in range(3)]
print(c1[0] + c2[1] + c3[2])

Submission status: Accepted

Solution code:
def readints():
    return list(map(int, input().split()))


# n, d = map(int, input().split())
# x = [input().split() for i in range(n)]
# print(x)

a = input()
b = input()
c = input()

print(a[0], end="")
print(b[1], end="")
print(c[2], end="")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S0=input()
S1=input()
S2=input()

print(S0[0]+S1[1]+S2[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = []
for _ in range(3):
    c.append(input())
# print(c)
print(c[0][0] + c[1][1] + c[2][2])

Submission status: Accepted

Solution code:
C1 = list(input())
C2 = list(input())
C3 = list(input())
print(C1[0],C2[1],C3[2],sep="")

Submission status: Accepted

Solution code:
def main():
    grids = [""] * 3
    for i in range(3):
        grids[i] = input()
    answer = ""
    for i in range(3):
        answer = answer + grids[i][i]
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = input()[0]
c += input()[1]
c += input()[2]
print(c)

Submission status: Accepted

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