1503B - 3-Coloring - CodeForces Solution

import math

ne = 1
aN = 0
aC = 0
ce = 0
n = int(input())


def nech(n):
    global ne
    global aN
    global aC
    global ce
    if (n % 2 == 0):
        res = [ne % n - 1 * (ne // n % 2) * ((n % 2 + 1) % 2), ne // n]
    else:
        res = [ne % n, ne // n]
    ne += 2
    aN += 1
    return res


def chet(n):
    global ne
    global aN
    global aC
    global ce
    if (n % 2 == 0):
        res = [ce % n + 1 * (ce // n % 2) * ((n % 2 + 1) % 2), ce // n]
    else:
        res = [ce % n, ce // n]
    ce += 2
    aC += 1
    return res


for i in range(n * n):
    col = int(input())
    if col == 2:
        if aN < int((n * n) / 2):
            x, y = map(int, nech(n))
            print(1, x + 1, y + 1)
        else:
            x, y = map(int, chet(n))
            print(3, x + 1, y + 1)
    if col == 1:
        if aC < math.ceil(n * n / 2):
            x, y = map(int, chet(n))
            print(2, x + 1, y + 1)
        else:
            x, y = map(int, nech(n))
            print(3, x + 1, y + 1)
    if (col == 3):
        if aC < math.ceil(n * n / 2):
            x, y = map(int, chet(n))
            print(2, x + 1, y + 1)
        else:
            x, y = map(int, nech(n))
            print(1, x + 1, y + 1)