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.util.*;
import java.io.*;
//import javafx.util.Pair;
public class Main 
{  
    
    static class Pair implements Comparable <Pair>
    {
        int x,y;        
        Pair(int x,int y)
        {
            this.x=x;
            this.y=y;
        }
        
        /*public boolean equals(Object obj)
        {
            if(obj==null)
                return false;
            if(obj==this)
                return true;
            if(!(obj instanceof Pair))
                return false;
            Pair o=(Pair) obj;
            return o.x==this.x && o.y==this.y;
        }
        
        public int hashCode()
        {
            return this.x+this.y;
        }*/
        
        public int compareTo(Pair p)
        {
            return Integer.compare(p.x,x);
        }
    }
    
    public static void main(String[] args)
    {
        InputStream inputStream=System.in;
        OutputStream outputStream=System.out;
        InputReader in=new InputReader(inputStream);
        PrintWriter out=new PrintWriter(outputStream);
        Task solver=new Task();
        solver.solve(1,in,out);
        out.close();
    }
    
    static class Task
    { 
        void solve(int testNumber, InputReader in, PrintWriter out)
        {            
            int x,y;
            int n=in.nextInt(); 
            HashMap <Integer,Integer>hm=new HashMap<>();
            for(int i=0;i<n*n;i++)
            {
                x=in.nextInt();
                y=hm.getOrDefault(x,0);
                hm.put(x,y+1);
            }
            PriorityQueue <Pair>pq=new PriorityQueue<>();
            int [][]a=new int[n][n];
            for(int i:hm.keySet())
                pq.add(new Pair(hm.get(i),i));
            Pair p;
            for(int i=0;i<n/2;i++)
            {
                for(int j=0;j<n/2;j++)
                {
                    p=pq.poll();
                    a[i][j]=p.y;
                    a[i][n-1-j]=p.y;
                    a[n-1-i][j]=p.y;
                    a[n-1-i][n-1-j]=p.y;
                    p.x-=4;
                    if(p.x!=0)
                        pq.add(p);
                }
            }
            if(n%2==1)
            {
                int i,j;
                i=n/2;
                for(j=0;j<n/2;j++)
                {
                    p=pq.poll();
                    a[i][j]=p.y;
                    a[i][n-1-j]=p.y;
                    p.x-=2;
                    if(p.x!=0)
                        pq.add(p);
                }
                j=n/2;
                for(i=0;i<n/2;i++)
                {
                    p=pq.poll();
                    a[i][j]=p.y;
                    a[n-1-i][j]=p.y;
                    p.x-=2;
                    if(p.x!=0)
                        pq.add(p);
                }
                p=pq.poll();
                a[n/2][n/2]=p.y;
            }
            if(pq.isEmpty())
            {
                out.println("Yes");
                for(int i=0;i<n;i++)
                {
                    for(int j=0;j<n;j++)
                        out.print(a[i][j]+" ");
                    out.println();
                }
            }
            else
                out.println("No");
        }
    }

    static class InputReader 
    {
        private InputStream stream;
        private byte[] buf=new byte[8192];
        private int curChar,snumChars;
        private InputReader.SpaceCharFilter filter;
        
        public InputReader(InputStream stream) 
        {
            this.stream=stream;
        }
 
        public int snext() 
        {
            if(snumChars==-1)
                throw new InputMismatchException();
            if(curChar>=snumChars)
            {
                curChar=0;
                try 
                {
                    snumChars=stream.read(buf);                
                } 
                catch(IOException e) 
                {
                    throw new InputMismatchException();
                }
                if(snumChars<=0)
                    return -1;
            }
            return buf[curChar++];
        }
 
        public int nextInt()
        {
            int c=snext();
            while(isSpaceChar(c))
                c=snext();
            int sgn=1;
            if(c=='-')
            {
                sgn=-1;
                c=snext();
            }
            int res=0;
            do
            {
                if(c<'0'||c>'9')
                    throw new InputMismatchException();
                res*=10;
                res+=c-'0';
                c=snext();
                }while(!isSpaceChar(c));
            return res*sgn;
        }
 
        public long nextLong()
        {
            int c=snext();
            while(isSpaceChar(c))
                c=snext();
            int sgn=1;
            if(c=='-')
            {
                sgn=-1;
                c=snext();
            }
            long res=0;
            do{
                 if (c<'0' || c>'9')
                    throw new InputMismatchException();
                res*=10;
                res+=c-'0';
                c=snext();
            }while (!isSpaceChar(c));
            return res * sgn;
        }
 
        public int[] nextIntArray(int n)
        {
            int a[]=new int[n];
            for(int i=0;i<n;i++)
                a[i]=nextInt();
            return a;
        }

        public long[] nextLongArray(int n)
        {
            long a[]=new long[n];
            for(int i=0;i<n;i++)
                a[i]=nextLong();
            return a;
        }
        
        public String nextString()
        {
            int c=snext();
            while(isSpaceChar(c))
                c=snext();
            StringBuilder res=new StringBuilder();
            do
            {
                res.appendCodePoint(c);
                c=snext();
            }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 interface SpaceCharFilter
        {
            public boolean isSpaceChar(int ch);
        }        
    }
}