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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeMap;
import java.util.StringTokenizer;
import java.util.Map;
import java.io.BufferedReader;
import java.util.ArrayDeque;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Liavontsi Brechka
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        CPalindromnayaMatrica solver = new CPalindromnayaMatrica();
        solver.solve(1, in, out);
        out.close();
    }

    static class CPalindromnayaMatrica {
        InputReader in;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.in = in;

            int n = ni();
            if (n == 1) {
                out.println("YES");
                out.print(in.nextInt());
                return;
            }

            int[] count = new int[2000];
            for (int i = 0; i < n * n; i++) {
                count[in.nextInt()]++;
            }

            TreeMap<Integer, ArrayDeque<CPalindromnayaMatrica.Pair>> tree = new TreeMap<>();
            for (int i = 0; i < 2000; i++) {
                if (count[i] != 0)
                    tree.computeIfAbsent(count[i], k -> new ArrayDeque<>()).offer(new CPalindromnayaMatrica.Pair(i, count[i]));
            }

            int[][] res = new int[n][n];

            Integer key = null;
            ArrayDeque<CPalindromnayaMatrica.Pair> next = null;
            CPalindromnayaMatrica.Pair nextPair = null;
            for (int i = 0; i < n / 2; i++) {
                for (int j = 0; j < n / 2; j++) {
                    if (key == null || next == null || (nextPair == null && next.isEmpty())) {
                        key = tree.ceilingKey(4);
                        if (key == null) {
                            out.print("NO");
                            return;
                        }

                        next = tree.remove(key);
                        nextPair = next.poll();
                    }

                    if (nextPair == null) nextPair = next.poll();

                    res[i][j] = res[n - i - 1][j] = res[i][n - j - 1] = res[n - i - 1][n - j - 1] = nextPair.i;
                    nextPair.count -= 4;

                    if (nextPair.count > 0 && nextPair.count < 4) {
                        tree.computeIfAbsent(nextPair.count, k -> new ArrayDeque<>()).offer(nextPair);
                        nextPair = null;
                    } else if (nextPair.count == 0) nextPair = null;
                }
            }

            if (nextPair != null && nextPair.count > 0)
                tree.computeIfAbsent(nextPair.count, k -> new ArrayDeque<>()).offer(nextPair);
            if (key != null && next != null && !next.isEmpty()) tree.put(key, next);

            if (n % 2 == 1) {
                key = null;
                next = null;
                nextPair = null;
                for (int i = 0; i < n / 2; i++) {
                    if (key == null || next == null || (nextPair == null && next.isEmpty())) {
                        key = tree.ceilingKey(2);
                        if (key == null) {
                            out.print("NO");
                            return;
                        }

                        next = tree.remove(key);
                        nextPair = next.poll();
                    }

                    if (nextPair == null) nextPair = next.poll();

                    res[i][n / 2] = res[n - i - 1][n / 2] = nextPair.i;
                    nextPair.count -= 2;

                    if (nextPair.count > 0 && nextPair.count < 2) {
                        tree.computeIfAbsent(nextPair.count, k -> new ArrayDeque<>()).offer(nextPair);
                        nextPair = null;
                    } else if (nextPair.count == 0) nextPair = null;
                }

                if (nextPair != null && nextPair.count > 0)
                    tree.computeIfAbsent(nextPair.count, k -> new ArrayDeque<>()).offer(nextPair);
                if (key != null && next != null && !next.isEmpty()) tree.put(key, next);

                key = null;
                next = null;
                nextPair = null;
                for (int i = 0; i < n / 2; i++) {
                    if (key == null || next == null || (nextPair == null && next.isEmpty())) {
                        key = tree.ceilingKey(2);
                        if (key == null) {
                            out.print("NO");
                            return;
                        }

                        next = tree.remove(key);
                        nextPair = next.poll();
                    }

                    if (nextPair == null) nextPair = next.poll();

                    res[n / 2][i] = res[n / 2][n - i - 1] = nextPair.i;
                    nextPair.count -= 2;

                    if (nextPair.count > 0 && nextPair.count < 2) {
                        tree.computeIfAbsent(nextPair.count, k -> new ArrayDeque<>()).offer(nextPair);
                        nextPair = null;
                    } else if (nextPair.count == 0) nextPair = null;
                }

                key = tree.ceilingKey(1);
                if (key == null) {
                    out.print("NO");
                    return;
                }

                next = tree.remove(key);

                res[n / 2][n / 2] = next.poll().i;
            }

            StringBuilder resS = new StringBuilder("YES\n");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    resS.append(res[i][j]).append(' ');
                }
                resS.append('\n');
            }
            out.print(resS);
        }

        private int ni() {
            return in.nextInt();
        }

        static class Pair {
            int i;
            int count;

            public Pair(int i, int count) {
                this.i = i;
                this.count = count;
            }

        }

    }

    static class InputReader {
        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                tokenizer = new StringTokenizer(readLine());
            }
            return tokenizer.nextToken();
        }

        public String readLine() {
            String line;
            try {
                line = reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
            return line;
        }

    }
}