//Problem: https://www.hackerrank.com/challenges/organizing-containers-of-balls
//Java 8
/*
Initial Thoughts: We can sum each column to get the
                  number of each type of ball, then
                  we can sum horizontally to get the
                  size of all of the containers, and
                  if the two sets of numbers don't match
                  then it is impossible
                  
Time Complexity: O(n^2) //We must look at every ball in a n*n matrix
Space Complexity: O(n^2) //We dynamically store them in sets
*/
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int q = in.nextInt();
        for(int a0 = 0; a0 < q; a0++){
            
            ///////////BUILD THE INPUT MATRIX///////////
            int n = in.nextInt();
            int[][] M = new int[n][n];
            for(int M_i=0; M_i < n; M_i++){
                for(int M_j=0; M_j < n; M_j++){
                    M[M_i][M_j] = in.nextInt();
                }
            }
            ////////////////////////////////////////////
            
            
            //Create a bag for the amount of  each ball and the sizes of containers
            LinkedList containers = new LinkedList<>();
            LinkedList balls = new LinkedList<>();
            for(int i = 0; i < n; i++){
                int rowSum = 0;
                int colSum = 0;
                for(int j = 0; j < n; j++){
                    rowSum += M[i][j]; 
                    colSum += M[j][i];
                }
                balls.add(colSum);
                containers.add(rowSum);
            }
            
            //Check if the two bags are equal
            containers.removeAll(balls);
            if(containers.isEmpty()) System.out.println("Possible");
            else System.out.println("Impossible");
        }
    }
}