#include<bits/stdc++.h>
using namespace std;
int n;
int sb;
int a[256];
int br=0;
int ans;
void f(int m)
{
    int b[256];
    priority_queue<int> q;
    int ind=3;
    b[0]=m;
    b[1]=a[0]-m;
    b[2]=a[1]-m;
    q.push(-(b[1]+b[2]));
    for(int i=2; i<n; i++)
    {
        if(a[i]==(-q.top()))
            q.pop();
        else
        {
            b[ind]=a[i]-m;
            for(int j=1;j<ind;j++)
            {
                q.push((-(b[j]+b[ind])));
            }
            ind++;
        }
    }
    for(int i=0;i<ind-1;i++)
    {
        cout<<b[i]<<" ";
    }
    cout<<b[ind-1]<<endl;
  //  cout<<b[0]<<" "<<b[1]<<" "<<b[2]<<endl;
  //cout<<ind<<endl;
    return;
}
    int main()
    {
        cin>>n;
        for(int i=0; i<n; i++)
        {
            cin>>a[i];
        }
        sb=a[0]+a[1];
        for(int i=2; i<n; i++)
        {
            if(a[i]>=sb)
                break;
            if((sb-a[i])%2==0)
            {
                br++;
                if(br==1)
                    ans=(sb-a[i])/2;
            }
        }
        cout<<br<<" "<<ans<<endl;
        f(ans);
        /* priority_queue <int> q;
         q.push(5);
         q.push(7);
         q.push(6);
         cout<<q.top()<<" ";
         q.pop();
         cout<<q.top()<<" ";
         q.pop();
         cout<<q.top()<<" ";
         q.pop();*/
        return 0;
    }