#include <bits/stdc++.h>

using namespace std;

long long n;
vector <long long> pi, v;

void kmp()
{
    for(long long i = 1; i < v.size(); i ++)
    {
        long long j = pi[i - 1];
        while(j  &&  v[j] != v[i])
            j = pi[j - 1];
        if(v[i] == v[i])
            pi[i] = j + 1;
        else
            pi[i] = 0;
    }
}

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    freopen("reguli.in", "r", stdin);
    freopen("reguli.out", "w", stdout);

    cin >> n;

    long long a;
    cin >> a;

    for(long long i = 1; i < n; i ++)
    {
        long long b;
        cin >> b;
//        cout << b << " ";
        v.push_back(b - a);
        a = b;
    }
//    for(long long x : v)
//        cout << x << " ";

    pi.resize(v.size(), 0);

    kmp();

    long long len = v.size() - pi.back();
    cout << len << "\n";
    for(long long i = 0; i < len; i ++)
        cout << v[i] << "\n";
    return 0;
}