Problem: The Dogeforces company has k employees. Each employee, except for lower-level employees, has at least 2 subordinates. Lower-level employees have no subordinates. Each employee, except for the head of the company, has exactly one direct supervisor. The head of the company is a direct or indirect supervisor of all employees. It is known that in Dogeforces, each supervisor receives a salary strictly more than all his subordinates.

The full structure of the company is a secret, but you know the number of lower-level employees and for each pair of lower-level employees, the salary of their common supervisor is known (if there are several such supervisors, then the supervisor with the minimum salary). You have to restore the structure of the company.

Input

The first line contains a single integer n (2 ≤ n ≤ 500) — the number of lower-level employees.

This is followed by n lines, where i-th line contains n integers a_{i,1}, a_{i,2}, ..., a_{i,n} (1 ≤ a_{i,j} ≤ 5000) — salary of the common supervisor of employees with numbers i and j. It is guaranteed that a_{i,j} = a_{j,i}. Note that a_{i,i} is equal to the salary of the i-th employee.

Output

In the first line, print a single integer k — the number of employees in the company.

In the second line, print k integers c_1, c_2, ..., c_k, where c_i is the salary of the employee with the number i.

In the third line, print a single integer r — the number of the employee who is the head of the company.

In the following k-1 lines, print two integers v and u (1 ≤ v, u ≤ k) — the number of the employee and his direct supervisor.

Note that the lower-level employees have numbers from 1 to n, and for the rest of the employees, you have to assign numbers from n+1 to k. If there are several correct company structures, you can print any of them.

Example

Input


3
2 5 7
5 1 7
7 7 4


Output


5
2 1 4 7 5 
4
1 5
2 5
5 4
3 4

Note

One of the possible structures in the first example: <image>

Solution (in CPP):

Solution:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <stdio.h>
#include <math.h>

using namespace std;

#define int long long
#define ll long long
#define double long double
#define pii pair<int, int>
#define vec vector
#define u_map unordered_map
#define u_set unordered_set
#define str string
#define all(el) el.begin(), el.end()
#define allr(el) el.rbegin(), el.rend()
#define sz(el) (int)el.size()
#define f first
#define s second
#define x first
#define y second

//#define mn first
//#define mx second

#define pb push_back
#define in insert
#define mp make_pair
#define endl "\n"
#define forn(i, n) for (int i = 0; i < n; ++i)

template<typename A, typename B> bool mini(A& x, const B y) {
    if (y < x) {
        x = y;
        return true;
    }
    return false;
}

template<typename A, typename B> bool maxi(A& x, const B y) {
    if (y > x) {
        x = y;
        return true;
    }
    return false;
}

const int maxN = 500 + 100;
const int maxSz = 20000;

vec<int> g[maxSz];

int a[maxN][maxN];

int p[maxSz];
int sz[maxSz];

void make_node(int x) {
    p[x] = x;
    sz[x] = 1;
}

int get_parent(int x) {
    if (p[x] == x) {
        return x;
    }
    return p[x] = get_parent(p[x]);
}

void unite(int a, int b) {
    a = get_parent(a);
    b = get_parent(b);
    if (a == b) return;
//    if (sz[a] > sz[b]) swap(a, b);
    p[a] = b;
//    sz[b] += sz[a];
}

signed main() {

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n;
    cin >> n;
    vec<int> val(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
            if (i == j) {
                val[i] = a[i][i];
            }
        }
    }

    vec<int> need;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i != j) need.pb(a[i][j]);
        }
    }

    sort(all(need));
    need.resize(unique(all(need)) - need.begin());

    int m = sz(need);

//    for (auto now : need) {
//        cout << now << ' ';
//    }

    for (int i = 0; i < n; i++) {
        make_node(i);
    }

    for (int i = 0; i < m; i++) {
        int cost = need[i];
        for (int j = 0; j < n; j++) {
            for (int k = j + 1; k < n; k++) {
                if (a[j][k] == cost && get_parent(j) != get_parent(k)) {

                    if (val[sz(val) - 1] != cost || (get_parent(j) != sz(val) - 1 && get_parent(k) != sz(val) - 1)) {
                        val.pb(cost);
                        make_node(sz(val) - 1);
                    }

                    g[sz(val) - 1].pb(get_parent(j));
                    g[sz(val) - 1].pb(get_parent(k));

                    unite(j, sz(val) - 1);
                    unite(k, sz(val) - 1);
                }
            }
        }
    }

    cout << sz(val) << endl;
    for (auto now : val) {
        cout << now << ' ';
    }
    cout << endl;

    cout << sz(val) << endl;

    for (int i = 0; i < sz(val); i++) {
//        cout << i << ": ";
        sort(all(g[i]));
        g[i].resize(unique(all(g[i])) - g[i].begin());
        for (int to : g[i]) {
            if (to != i) cout << to + 1 << ' ' << i + 1 << endl;
        }
//        cout << endl;
    }


    return 0;

}