Ruudukko

def generate_empty_grid(n):
    grid = []
    for row in range(0, n):
        grid.insert(row, [0] * n)
    return grid

def get_lowest_int(grid, n_row, n_col):    
    if n_col == 0 and n_row == 0: return 1

    row_vals = n_col > 0 and grid[n_row][0:n_col] or []
    
    col_vals = []
    for n_upper_row in range(0, n_row):
        col_vals.append(grid[n_upper_row][n_col])

    taken_vals = row_vals + col_vals
    # find lowest missing integer in range 1 to len(grid)
    for val in range(0, len(grid)):
        val += 1
        if not val in taken_vals:
            return val


def main(n):
    grid = generate_empty_grid(n)

    for n_row, row in enumerate(grid):
        for n_col in range(0, len(row)):
            row[n_col] = get_lowest_int(grid, n_row, n_col)
        print(' '.join(map(str, row)))

main(int(input()))

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER