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:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


def main():
    c1 = input()
    c2 = input()
    c3 = input()
    print('%s%s%s' % (c1[0], c2[1], c3[2]))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
c = [input() for i in range(3)]
list = []
for i in range(3):
    d = c[i]
    e = d[i]
    list.append(e)
for j in list:
    print(j , end = "")

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():
    data = [list(input()) for i in range(3)]
    print(data[0][0] + data[1][1] + data[2][2])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

print(''.join(s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = 0
a = []
while i < 3:
  a.append(input())
  i += 1

print(a[0][0] + a[1][1] + a[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:
import sys


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

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = ""
for i in range(3):
    row = (list(input()))
    A += row[i]
print(A)

Submission status: Accepted

Solution code:
str = ''

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = [input() for i in range(3)]
    print(s[0][0] + s[1][1] + s[2][2])

solve()

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:
c1=input()
c2=input()
c3=input()
print(c1[0]+c2[1]+c3[2])
exit()

Submission status: Accepted

Solution code:
a = list(map(str,input()))
b = list(map(str,input()))
c = list(map(str,input()))
print("".join([a[0],b[1],c[2]]))

Submission status: Accepted

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

print(ans)

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:
a,b,c = [input() for i in range(3)]
ans = a[0]+b[1]+c[2]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def read_input():
    c1 = input()
    c2 = input()
    c3 = input()

    return [c1, c2, c3]

def submit():
    c = read_input()

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



if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
a=input()
f=input()
j=input()
print(a[0]+f[1]+j[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
	main()

Submission status: Accepted

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

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
print(input()[0],end="")
print(input()[1],end="")
print(input()[2],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:
c1,c2,c3=list(input()),list(input()),list(input())
print(c1[0]+c2[1]+c3[2])

Submission status: Accepted

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

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:
s1 = list(str(input()))
s2 = list(str(input()))
s3 = list(str(input()))
print(s1[0] + s2[1] + s3[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i=input;print((i()+i()+i())[::4])

Submission status: Accepted

Solution code:
print((input()+input()+input())[::4])

Submission status: Accepted

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

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:
import sys
input = sys.stdin.readline

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

print(a + b + c)

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


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

Submission status: Accepted

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

Submission status: Accepted

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

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:
# ABC090A - Diagonal String
data = [input().rstrip() for _ in range(3)]
print(data[0][0], data[1][1], data[2][2], sep='')

Submission status: Accepted

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

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:
S = [input()[i] for i in range(3)]
print("".join(S))

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_1 = input()
c_2 = input()
c_3 = input()

print("{}{}{}".format(c_1[0], c_2[1], c_3[2]))

Submission status: Accepted

Solution code:
x, y, z = input(), input(), input()
print(x[0] + y[1] + z[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,B,C = [input() for i in range(3)]
a = [A[:1], A[1:2], A[2:]]
b = [B[:1], B[1:2], B[2:]]
c = [C[:1], C[1:2], C[2:]]
print(a.pop(0) + b.pop(1) + c.pop(2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

i = 0
for _ in range(3):
    print(input()[i], end = '')
    i += 1

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
r1 = input()
r2 = input()
r3 = input()

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

Submission status: Accepted

Solution code:
c_one = input()
c_two = input()
c_three = input()
print(c_one[0] + c_two[1] + c_three[2])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = 3
C = [None] * 3
for i in range(n):
  C[i] = input()[i]

print(''.join(C))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
c=[]
for i in range(3):
    c.append(list(str(input())))
print(str(c[0][0]), str(c[1][1]), str(c[2][2]), sep="")

Submission status: Accepted

Solution code:
moji = []
for i in range(3):
        c = str(input())
        moji.append(c[i])
print("".join(moji))

Submission status: Accepted

Solution code:
i=input;print(''.join((i()[0],i()[1],i()[2])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=eval('input(),'*3)
print(''.join([A[i][i] for i in range(3)]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
result = ""
for i in range(0, 3):
    a = input()
    result += a[i]

print(result)

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:
ans = ""
cnt = 0
for i in range(3):
    s = input()
    ans += s[cnt]
    cnt += 1
print(ans)

Submission status: Accepted

Solution code:
# Rows and columns(行と列)
rac_count = 3
rac_all = [input() for a in range(rac_count)]

rac_0 = list(rac_all[0])
rac_1 = list(rac_all[1])
rac_2 = list(rac_all[2])

rac_0.extend(rac_1)
rac_0.extend(rac_2)

print(str(rac_0[0] + rac_0[4] + rac_0[8]))

Submission status: Accepted

Solution code:
# Rows and columns(行と列)
rac_count = 3
rac_all = [input() for a in range(rac_count)]

rac_0 = rac_all[0]
rac_1 = rac_all[1]
rac_2 = rac_all[2]

rac_0_0 = list(rac_0)
rac_1_1 = list(rac_1)
rac_2_2 = list(rac_2)

rac_0_0.extend(rac_1_1)
rac_0_0.extend(rac_2_2)

print(str(rac_0_0[0] + rac_0_0[4] + rac_0_0[8]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

abc = a[0] + b[1] + c[2]
abc = "".join(abc)

print(abc)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(''.join(s[i] for i, s in enumerate(input() for _ in range(3))))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
C1 = input()
C2 = input()
C3 = input()

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

Submission status: Accepted

Solution code:
def solve(string):
    c = "".join(string.split())
    return c[0] + c[4] + c[-1]


if __name__ == '__main__':
    n = 3
    print(solve('\n'.join([input() for _ in range(n)])))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
one=input()
two=input()
three=input()
ans=one[0]+two[1]+three[2]
print(ans)

Submission status: Accepted

Solution code:
row1 = input()
row2 = input()
row3 = input()
print(row1[0]+row2[1]+row3[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(input())
b = list(input())
c = list(input())
print(a[0],end="")
print(b[1],end="")
print(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:
a = input()
b= input()
c = input()
print(a[0] + b[1] + c[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import cmath

INF=1e18
MOD=1e9+7


s=input()
t=input()
u=input()

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

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:
arr  = [list(input()) for i in range(3)]
print(arr[0][0] + arr[1][1] + arr[2][2])

Submission status: Accepted

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

Submission status: Accepted

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

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:
ans = ''
for i in range(3): ans+=input()[i]
print(ans)

Submission status: Accepted

Solution code:
def diagonal_string(C: list) -> str:
    return ''.join(C[i][i] for i in range(3))


if __name__ == "__main__":
    C = [input() for _ in range(3)]
    ans = diagonal_string(C)
    print(ans)

Submission status: Accepted

Solution code:
import sys
lines = sys.stdin.readlines()
ans = []
for i, l in enumerate(lines):
  ans.append(l[i])
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
s1 = input()
s2 = input()
s3 = input()
ans = s1[0] + s2[1] + s3[2]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc090/tasks/abc090_a

import itertools
import collections
import bisect

def main():
    one = input()
    two = input()
    thr = input()
    print(one[0] + two[1] + thr[2])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
write = sys.stdout.write

for i in range(3):
    temp = input()
    write(temp[i])
write("\n")

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
S = [input() for _ in range(3)]
print(S[0][0] + S[1][1] + S[2][2])

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    ans = ''
    for i in range(3):
        S = str(input().strip())
        ans += S[i]
    print(ans)

if __name__ == '__main__':
    main()

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:
#A
c = [''] * 3
for i in range(3):
    c[i] = str(input())
print(c[0][0] + c[1][1] + c[2][2])

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:
C = [input() for _ in range(3)]
print(C[0][0] + C[1][1] + C[2][2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for num, li_con in enumerate(list1):
    list2.append(li_con[num])

moji = "".join(list2)
print(moji)

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc090/tasks/abc090_a
c1 = list(input())
c2 = list(input())
c3 = list(input())
print(c1[0] + c2[1] + c3[2])

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

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:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))

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

print("{}{}{}".format(a[0],b[1],c[2]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin

data = [list(stdin.readline().rstrip()) for _ in range(3)]
print(data[0][0]+data[1][1]+data[2][2])

Submission status: Accepted

Solution code:
s_1=input()
s_2=input()
s_3=input()
print(s_1[0]+s_2[1]+s_3[2])

Submission status: Accepted

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

Submission status: Accepted

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

ans = cs[0][0] + cs[1][1] + cs[2][2]

print(ans)
print()

Submission status: Accepted

Solution code:
def main():
    inputs = [input() for _ in range(3)]
    ans = ""
    for i, x in enumerate(inputs):
        ans += x[i]
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A=input()
B=input()
C=input()
a=A[:1]
b=B[1:2]
c=C[2:3]
print(a+b+c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

ss = [input() for _ in range(3)]

for i in range(3):
    print(ss[i][i],end = '')

print()

#print('{}{}{}'.format(ss[0][0],ss[1][1],ss[2][2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

a = S()
b = S()
c = S()

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

Submission status: Accepted

Solution code:
ans=''
for i in range(3):
  s=input()
  ans+=s[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:
c = [raw_input() for _ in range(3)]
print c[0][0]+c[1][1]+c[2][2]

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ar_a = list(input())
ar_b = list(input())
ar_c = list(input())
print(ar_a[0] + ar_b[1] + ar_c[2])

Submission status: Accepted

Solution code:
char = []
for i in range(3):
    char += list(input())
print(char[0] + char[4] + char[8])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = 3
c = []
i = 0

for i in range(N):
	c.append(input().strip())

out = ""

for i in range(N):
    out = out + c[i][i]
    
print(out)

Submission status: Accepted

Solution code:
c1 = list(input())
c2 = list(input())
c3 = list(input())
d = (c1[0],c2[1],c3[2])
print("".join(d))

Submission status: Accepted

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

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:
c1 = input()
c2 = input()
c3 = input()

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

Submission status: Accepted

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

a = ""
a += c[0][0]
a += c[1][1]
a += c[2][2]

print(a)

Submission status: Accepted

Solution code:
h1 = str(input())
h2 = str(input())
h3 = str(input())
print(h1[0] + h2[1] + h3[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:
x,y,z = (input() for i in range(3))
print(x[0]+y[1]+z[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:
n = 3
ans = ""
for i in range(n):
    text = input()
    ans += text[i]

print(ans)

Submission status: Accepted

Solution code:
""" AtCoder """

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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=['']*3
for i in range(3):
    a[i]=input()
b=[]
b.append(a[0][0])
b.append(a[1][1])
b.append(a[2][2])
ans=''.join(b)
print(ans)

Submission status: Accepted

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

for i in range(3):
    print(b[i][i], end='')
print()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

lines=[input() for _ in range(3)]



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

Submission status: Accepted

Solution code:

lines=[input() for _ in range(3)]

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

Submission status: Accepted

Solution code:
a = ''
for i in range(3):
    a += input()
print(a[0]+a[4]+a[8])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    s0 = input()
    s1 = input()
    s2 = input()

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


if __name__ == '__main__':
    main()

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:
a = list(str(input()))
b = list(str(input()))
c = list(str(input()))
print(a[0]+b[1]+c[2])

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ans_1 = input()
ans_2 = input()
ans_3 = input()
print(ans_1[0] + ans_2[1] + ans_3[2])