/// https://www.infoarena.ro/automate-finite-si-kmp
#include <fstream>
#include <cstring>

using namespace std;

const int NMAX = 1e6 + 1;

ifstream fin("prefix.in");
ofstream fout("prefix.out");

int n, a[NMAX], pi[NMAX];

void calcPrefix()
{
    int x = 0;
    pi[1] = 0;
    for(int i = 2; i <= n; ++i)
    {
        while(x > 0 && a[x + 1] != a[i])
            x = pi[x];
        if(a[x + 1] == a[i])
            ++x;
        pi[i] = x;
    }
}

void citire()
{
    fin >> n >> a[1];
    for(int i = 2; i <= n; ++i)
    {
        fin >> a[i];
        a[i - 1] = a[i] - a[i - 1];
    }
    --n;
}

void solutie()
{
    calcPrefix();
    fout << n - pi[n] << "\n";
    for(int i = 1; i <= n - pi[n]; ++i) fout << a[i] << "\n";
}

int main()
{
    citire();
    solutie();
    return 0;
}