#include <fstream>

using namespace std;

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

const int N=500000+5;

int n;
int v[N];
int ps[N];

inline void build_ps()
{
    int i=1;
    int cur=0;
    while(i<n)
    {
        if(v[i]==v[cur])
        {
            cur++;
            ps[i]=cur;
            i++;
        }
        else
        {
            if(cur==0)
            {
                i++;
            }
            else
            {
                cur=ps[cur-1];
            }
        }
    }
}

int main()
{
    fin>>n;
    int l;
    fin>>l;
    for(int i=0;i+1<n;i++)
    {
        int x;
        fin>>x;
        v[i]=x-l;
        l=x;
    }
    n--;
    build_ps();
    int ans=n;
    for(int i=n-1;i>=0;i--)
    {
        if(i!=n-1 && ps[i]+1!=ps[i+1]) break;
        if((i+1)%(i+1-ps[i])==0)
        {
            ans=i+1;
        }
    }
    fout<<ans<<"\n";
    for(int i=0;i<ans;i++)
    {
        fout<<v[i]<<"\n";
    }
    return 0;
}