#include <iostream>
#include <vector>
using namespace std;

const int MAXN = 505;

int n, m;
int a[MAXN * MAXN];

void Init()
{
    ios :: sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    cin >> n;
    m = n * (n - 1) / 2;
    for (int i = 1; i <= m; ++ i)
    {
        cin >> a[i];
    }
}

int state[MAXN];
int sum[MAXN][MAXN];

int cnt;
vector<int> v, tmp;

void Finish()
{
    int s12 = sum[1][2];
    int s13 = sum[1][3];
    int s23 = sum[2][3];

    int v2 = (s12 + s23 - s13) / 2;
    int v1 = s12 - v2;
    int v3 = s23 - v2;

    tmp.resize(0);
    tmp.push_back(v1);
    for (int i = 2; i <= n; ++ i)
    {
        tmp.push_back(sum[i - 1][i] - tmp.back());
    }

    for (int i = 1; i <= n; ++ i)
    {
        for (int j = i + 1; j <= n; ++ j)
        {
            if (sum[i][j] != tmp[i - 1] + tmp[j - 1]) return;
        }
    }

    cnt++;

    if (v.size() == 0) v = tmp;
    else
    {
        bool cmp = true;
        for (int i = 0; i < tmp.size(); ++ i)
        {
            if (v[i] < tmp[i])
            {
                cmp = false;
                break;
            }
        }
        if (cmp) v = tmp;
    }
}

void Rec(int x)
{
    if (x == m + 1)
    {
        Finish();
        return;
    }

    int opt = 1;
    for (int i = 1; i <= n; ++ i)
    {
        if ((state[i] + 1 <= opt or i == 1) and state[i] + 1 <= n)
        {
            sum[i][++state[i]] = a[x];

            bool fl = true;
            /*for (int p = 1; p <= n; ++ p)
            {
                if (fl == false) break;
                for (int q = p + 1; q <= n; ++ q)
                {
                    if (p == i or q == i) continue;
                    int s1 = max(sum[p][i], sum[i][p]);
                    int s2 = max(sum[state[i]][q], sum[q][state[i]]);
                    int s3 = max(sum[p][q], sum[q][p]);

                    if (s1 == 0 or s2 == 0 or s3 == 0) continue;
                    if (s1 + s2 != s3 + a[x])
                    {
                        fl = false;
                        break;
                    }
                }
            }*/

            if (fl) Rec(x + 1);
            state[i]--;
        }

        opt = max(opt, state[i]);
    }

}

int main()
{
    Init();

    if (n == 2)
    {
        cout << a[1] / 2 << endl;
        cout << 1 << ' ' << a[1] - 1 << endl;
        return 0;
    }

    for (int i = 1; i <= n; ++ i)
    {
        state[i] = i;
    }
    Rec(1);

    cout << cnt << endl;
    for (int i = 0; i < v.size(); ++ i)
    {
        cout << v[i] << ' ';
    }
    cout << endl;
    return 0;
}

/*
3
3 4 5
*/