#Tommy Luo

#February 26, 2013

#Mr. Potter

#Contest 3

#Enloe High School

#Senior 5 Division

f = open("ChessInput2.txt", "r")

def check(queen, pieces):

if len(pieces) == 0:

return str(queen)[1:-1]

else:

hold = pieces[0]

if (queen[0] == hold[0]) or (queen[1] == hold[1]) or (abs(queen[0] - hold[0]) == abs(queen[1] - hold[1])):

return check(queen, pieces[1:])

else:

return 'NONE'

for line in f:

line = line.strip().split(',')

line = line[:-2]

pieces = list()

for x in range(0, len(line), 2):

pieces.append((int(line[x]), int(line[x+1])))

poss = list()

for piece in pieces:

for dist in xrange(9):

if (piece[0] - dist > 0) and (piece[0] - dist < 9):

if ((piece[0] - dist,piece[1]) not in poss) and ((piece[0] - dist,piece[1]) not in pieces):

poss.append((piece[0] - dist,piece[1]))

if (piece[0] + dist > 0) and (piece[0] + dist < 9):

if ((piece[0] + dist,piece[1]) not in poss) and ((piece[0] + dist,piece[1]) not in pieces):

poss.append((piece[0] + dist,piece[1]))

if (piece[1] - dist > 0) and (piece[1] - dist < 9):

if ((piece[0],piece[1] - dist) not in poss) and ((piece[0],piece[1] - dist) not in pieces):

poss.append((piece[0],piece[1] - dist))

if (piece[1] + dist > 0) and (piece[1] + dist < 9):

if ((piece[0],piece[1] + dist) not in poss) and ((piece[0],piece[1] + dist) not in pieces):

poss.append((piece[0],piece[1] + dist))

if (piece[1] + dist > 0) and (piece[1] + dist < 9) and (piece[0] + dist > 0) and (piece[0] + dist < 9) :

if ((piece[0] + dist,piece[1] + dist) not in poss) and ((piece[0] + dist,piece[1] + dist) not in pieces):

poss.append((piece[0] + dist,piece[1] + dist))

if (piece[1] - dist > 0) and (piece[1] - dist < 9) and (piece[0] + dist > 0) and (piece[0] + dist < 9) :

if ((piece[0] + dist,piece[1] - dist) not in poss) and ((piece[0] + dist,piece[1] - dist) not in pieces):

poss.append((piece[0] + dist,piece[1] - dist))

if (piece[1] + dist > 0) and (piece[1] + dist < 9) and (piece[0] - dist > 0) and (piece[0] - dist < 9) :

if ((piece[0] - dist,piece[1] + dist) not in poss) and ((piece[0] - dist,piece[1] + dist) not in pieces):

poss.append((piece[0] - dist,piece[1] + dist))

if (piece[1] - dist > 0) and (piece[1] - dist < 9) and (piece[0] - dist > 0) and (piece[0] - dist < 9) :

if ((piece[0] - dist,piece[1] - dist) not in poss) and ((piece[0] - dist,piece[1] - dist) not in pieces):

poss.append((piece[0] - dist,piece[1] - dist))

poss.sort()

#print poss

q = 0

result = 'NONE'

while (q < len(poss)) and (result == 'NONE'):

result = check(poss[q], pieces)

q+=1

print result

f.close()