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



if __name__ == "__main__":
    solve()

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

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:
a=input()+input()+input();print(a[::4])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(c11+c22+c33)

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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="")

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:
C1=str(input())
C2=str(input())
C3=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

print(d)

Submission status: Accepted

Solution code:
# a, b, c = map(int, input().split())
s1 = input()
s2 = input()
s3 = input()
print(s1[0]+s2[1]+s3[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()

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

Submission status: Accepted

Solution code:
#n=int(input())
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
c1=input()
c2=input()
c3=input()
print(c1[0]+c2[1]+c3[2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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]))

Submission status: Accepted

Solution code:
# input
C = [list(input()) for n in range(3)]

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

Submission status: Accepted

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

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

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:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

C = c11 + c22 + c33

print(C)

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
c3 = input()
print('{}{}{}'.format(c1[0],c2[1],c3[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:
a = list(input())
b = list(input())
c = list(input())
res = a[0] + b[1] + c[2]
print("".join(res))

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
def main():
    A = list(str(input()))
    B = list(str(input()))
    C = list(str(input()))
    print(A[0] + B[1] + C[2])
main()

Submission status: Accepted

Solution code:
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()

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:
# coding: utf-8
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)))

Submission status: Accepted

Solution code:
# coding: utf-8
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ans = ''

for i in range(3):
    tmps = input()
    ans += tmps[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:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
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])

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
a,b,c=input(),input(),input();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])

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

Submission status: Accepted

Solution code:
def actual(C):
    return C[0][0] + C[1][1] + C[2][2]
    # return ''.join((C[i][j] for i, j in zip(range(len(C)), range(len(C)))))

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

print(actual(C))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
c = input()
d = input()
e = input()
print(c[0]+d[1]+e[2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
c1 = input()
c2 = input()
c3 = input()
print(c1[0] + c2[1] + c3[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:
s = "".join([input() for _ in range(3)])
print(s[0] + s[4] + s[8])

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:
def main():
  c = [input() for _ in range(3)]
  print(c[0][0] + c[1][1] + c[2][2])
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
C = [""]*3
res = ""
for i in range(3):
    C[i] = str(input())
    res = res + C[i][i]
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = [input().split() for j in range(3)]
print(c[0][0][0] + c[1][0][1] + c[2][0][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:
import collections

#文字列を一文字ずつ取得したいとき
def inputStrOnebyOne():
    s = list(input())
    return s

#整数を一つずつリストに入れる
def inputOnebyOne_Int():
    a = list(int(x) for x in input().split())
    return a

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
C = [list(input()) for _ in range(3)]
ans = [c for i, ci in enumerate(C) for j, c in enumerate(ci) if i == j]
print(''.join(ans))

Submission status: Accepted

Solution code:
sa = input()
sb = input()
sc = input()
print(sa[0] + sb[1] + sc[2])

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(input()[0] + input()[1] + input()[2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 00:43:31 2020

@author: shinba
"""

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

a = inputSLs(3)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    A = []
    for i in range(3):
        s = input()
        A.append(s[i])
    print(''.join(A))

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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:
c_1 = list(input())
c_2 = list(input())
c_3 = list(input())
print(c_1[0]+c_2[1]+c_3[2])

Submission status: Accepted

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

Submission status: Accepted

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

print(s)

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:
def ABC_90_A():
    C1 = input()
    C2 = input()
    C3 = input()
    print(C1[0]+C2[1]+C3[2])

if __name__ == '__main__':

    ABC_90_A()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C11C12C13=input()
C21C22C23=input()
C31C32C33=input()
print (C11C12C13[0]+C21C22C23[1]+C31C32C33[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:
def main():
    a,b,c = (input() for _ in range(3))
    print(a[0]+b[1]+c[2])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
for i in range(3):
    c = input()
    print(c[i], 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:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
print(rs()[0]+rs()[1]+rs()[2])

Submission status: Accepted

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

c11 = diagonal_string[0][0]
c22 = diagonal_string[1][1]
c33 = diagonal_string[2][2]
print("{}{}{}".format(c11,c22,c33))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

print("{}{}{}".format(s1[0],s2[1],s3[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,b,c=map(list,open(0));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:

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

print(c11 + c22 + c33)

Submission status: Accepted

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

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

Submission status: Accepted

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


def solve(c: "List[str]"):
    return c[0][0] + c[1][1] + c[2][2]


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
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]"
    print(solve(c))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    #test()
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

c = [input() for _ 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:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


def MI(): return map(int, input().split())


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


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


show_flg = False
# show_flg = True


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(s1+s2+s3)

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:
def main():
    c = [input() for _ in range(3)]
    s = ''.join(c[i][i] for i in range(3))
    print(s)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
# https://atcoder.jp/contests/abc090/tasks/abc090_a

C = []
for i in ra(3):
    print(input()[i], end='')

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
answer=""

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

print(answer)