Problem: Let's call some square matrix with integer values in its cells palindromic if it doesn't change after the order of rows is reversed and it doesn't change after the order of columns is reversed.

For example, the following matrices are palindromic:

<image>

The following matrices are not palindromic because they change after the order of rows is reversed:

<image>

The following matrices are not palindromic because they change after the order of columns is reversed:

<image>

You are given n^2 integers. Put them into a matrix of n rows and n columns so that each number is used exactly once, each cell contains exactly one number and the resulting matrix is palindromic. If there are multiple answers, print any. If there is no solution, print "NO".

Input

The first line contains one integer n (1 ≤ n ≤ 20).

The second line contains n^2 integers a_1, a_2, ..., a_{n^2} (1 ≤ a_i ≤ 1000) — the numbers to put into a matrix of n rows and n columns.

Output

If it is possible to put all of the n^2 numbers into a matrix of n rows and n columns so that each number is used exactly once, each cell contains exactly one number and the resulting matrix is palindromic, then print "YES". Then print n lines with n space-separated numbers — the resulting matrix.

If it's impossible to construct any matrix, then print "NO".

You can print each letter in any case (upper or lower). For example, "YeS", "no" and "yES" are all acceptable.

Examples

Input


4
1 8 8 1 2 2 2 2 2 2 2 2 1 8 8 1


Output


YES
1 2 2 1
8 2 2 8
8 2 2 8
1 2 2 1


Input


3
1 1 1 1 1 3 3 3 3


Output


YES
1 3 1
3 1 3
1 3 1


Input


4
1 2 1 9 8 4 3 8 8 3 4 8 9 2 1 1


Output


NO


Input


1
10


Output


YES
10 

Note

Note that there exist multiple answers for the first two examples.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.lang.*;


public class Main implements Runnable {
    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        public int nextInt() {
            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;

            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
            return res * sgn;
        }

        public double nextDouble() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') {
                c = read();
                double m = 1;
                while (!isSpaceChar(c)) {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));

            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);
        }
    }

    public static void main(String args[]) throws Exception {
        new Thread(null, new Main(), "Main", 1 << 26).start();
    }

    static long gcd(long a, long b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }

    static int gcd(int a, int b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }

    static long modPow(long a, long p, long m) {
        if (a == 1) return 1;
        long ans = 1;
        while (p > 0) {
            if (p % 2 == 1) ans = (ans * a) % m;
            a = (a * a) % m;
            p >>= 1;
        }
        return ans;
    }

    static long modInv(long a, long m) {
        return modPow(a, m - 2, m);
    }

    static long sol_x, sol_y, gcd_a_b;

    static void extendedEuclid(long a, long b) {
        if (b == 0) {
            gcd_a_b = a;
            sol_x = 1;
            sol_y = 0;
        } else {
            extendedEuclid(b, a % b);
            long temp = sol_x;
            sol_x = sol_y;
            sol_y = temp - (a / b) * sol_y;
        }
    }

    long modInverse(long a, long prime)
    {
        a = a % prime;
        for (int x=1; x<prime; x++)
            if ((a*x) % prime == 1)
                return x;

        return -1;
    }

    static class Bhavansort {
        Random random;

        Bhavansort(int a[]) {
            randomArray(a);
            sort(a);
        }

        Bhavansort(long a[]) {
            randomArray(a);
            sort(a);
        }

        static int[] sort(int a[]) {
            Arrays.sort(a);
            return a;
        }

        static long[] sort(long a[]) {
            Arrays.sort(a);
            return a;
        }

        void randomArray(long a[]) {
            int n = a.length;
            for (int i = 0; i < n; i++) {
                int p = random.nextInt(n) % n;
                long tm = a[i];
                a[i] = a[p];
                a[p] = tm;
            }
        }

        void randomArray(int a[]) {
            int n = a.length;
            for (int i = 0; i < n; i++) {
                int p = random.nextInt(n) % n;
                int tm = a[i];
                a[i] = a[p];
                a[p] = tm;
            }
        }
    }


    public void run() {
        InputReader sc = new InputReader(System.in);
        //Scanner sc=new Scanner(System.in);
        // Random rn=new Random();
        PrintWriter out = new PrintWriter(System.out);

        int n=sc.nextInt();

        if(n%2==0){
            int fre[]=new int[1001];
            int a[]=new int[n*n];
            for (int i = 0; i <n*n ; i++) {
                a[i]=sc.nextInt();
                fre[a[i]]++;
            }
            int ans[][]=new int[n][n];
            for (int i = 0; i <n/2 ; i++) {
                for (int j = 0; j <n/2 ; j++) {
                    int ff=0;
                    for (int k = 0; k <a.length ; k++) {
                        if(fre[a[k]]>=4){
                            ans[i][j]=a[k];
                            ans[n-i-1][n-j-1]=a[k];
                            ans[n-i-1][j]=a[k];
                            ans[i][n-j-1]=a[k];
                            fre[a[k]]-=4;
                            ff=1;
                         //   out.println(a[k]+" "+fre[a[k]]);
                            break;
                        }
                    }
                    if(ff==0){
                        out.println("no");
                        out.close();
                        return;
                    }
                }
            }
            int tt=0;
            for (int i = 0; i <1001 ; i++) {
                tt|=fre[i];
            }
            if(tt==0){
                out.println("yes");
                for (int i = 0; i <n ; i++) {
                    for (int j = 0; j <n ; j++) {
                        out.print(ans[i][j]+" ");
                    }
                    out.println();
                }
            }
            else{
                out.println("no");
            }
        }
        else{
            int fre[]=new int[1001];
            int a[]=new int[n*n];
            for (int i = 0; i <n*n ; i++) {
                a[i]=sc.nextInt();
                fre[a[i]]++;
            }
            int ans[][]=new int[n][n];
            for (int i = 0; i <n/2 ; i++) {
                for (int j = 0; j <n/2 ; j++) {
                    int ff=0;
                    for (int k = 0; k <a.length ; k++) {
                        if(fre[a[k]]>=4){
                            ans[i][j]=a[k];
                            ans[n-i-1][n-j-1]=a[k];
                            ans[n-i-1][j]=a[k];
                            ans[i][n-j-1]=a[k];
                            fre[a[k]]-=4;
                            ff=1;
                            //   out.println(a[k]+" "+fre[a[k]]);
                            break;
                        }
                    }
                    if(ff==0){
                        out.println("no");
                        out.close();
                        return;
                    }
                }
            }

            for (int i = 0; i <n/2 ; i++) {
                int ff=0;
                for (int j = 0; j <a.length ; j++) {
                    if(fre[a[j]]>=2){
                        ans[n/2][i]=a[j];
                        ans[n/2][n-i-1]=a[j];
                        fre[a[j]]-=2;
                        ff=1;
                        break;
                    }

                }
                if(ff==0){
                    out.println("no");
                    out.close();
                    return;
                }
            }

            for (int i = 0; i <n/2 ; i++) {
                int ff=0;
                for (int j = 0; j <a.length ; j++) {
                    if(fre[a[j]]>=2){
                        ans[i][n/2]=a[j];
                        ans[n-i-1][n/2]=a[j];
                        fre[a[j]]-=2;
                        ff=1;
                        break;
                    }

                }
                if(ff==0){
                    out.println("no");
                    out.close();
                    return;
                }
            }

            for (int i = 0; i <a.length ; i++) {
                if(fre[a[i]]!=0){
                    ans[n/2][n/2]=a[i];
                    fre[a[i]]--;
                }
            }

            int tt=0;
            for (int i = 0; i <1001 ; i++) {
                tt|=fre[i];
            }
            if(tt==0){
                out.println("yes");
                for (int i = 0; i <n ; i++) {
                    for (int j = 0; j <n ; j++) {
                        out.print(ans[i][j]+" ");
                    }
                    out.println();
                }
            }
            else{
                out.println("no");
            }


        }




        out.close();

    }


    class Node{
        int val,fre;

        public Node(int val, int fre) {
            this.val = val;
            this.fre = fre;
        }
    }

}