#include <bits/stdc++.h>

using namespace std;

const int maxn = 500, maxv = 1000;

int n, v[maxn + 1], p2[maxv + 1];

struct Nr  {
    public:
    static const int MAX = 150;
    int a[MAX];
    inline int add(Nr b)  {
        int i = 1, rest = 0;
        for(;i <= max(a[0], b.a[0]) || rest;)  {
            int cai = a[i];
            a[i] = (a[i] + b.a[i] + rest) % 10;
            rest = (cai + b.a[i] + rest) / 10;i++;
        }
        a[0] = i - 1;
    }
    inline int scad(Nr b)  {
        int i = 1, rest = 0;
        for(;i <= a[0] || rest;)  {
            if(a[i] - b.a[i] - rest >= 0)
                a[i] -= b.a[i] + rest, rest = 0;
            else  {
                a[i] = 10 + a[i] - b.a[i] - rest;
                rest = 1;
            }i++;
        }
        a[0] = i - 1;
        if(a[0] <= 0)
            a[0] = 1;
        while(a[a[0]] == 0)
            a[0]--;
        if(a[0] <= 0)
            a[0] = 1;
    }
};

int main()  {
    freopen("indep.in", "r", stdin);
    freopen("indep.out", "w", stdout);
    Nr a, b;
    a.a[0] = 1;
    b.a[0] = 1;
    a.a[1] = 1;
    b.a[1] = 1;
    a.scad(b);
    cerr << a.a[0] << "\n";
    for(int i = a.a[0];i >= 1;i--)
        cerr << a.a[i] << " ";
//    cin >> n;
//    int maxx = -1;
//    for(int i = 1;i <= n;i++)
//        cin >> v[i], maxx = max(maxx, v[i]);
//    p2[0] =
//    for(int i = 1;i <= maxx;i++)
//        p2[i] =
    return 0;
}