#include <cstdio>

int x[500001], a[500001], s[500001], put[1000001];
int p = 1327, mod = 10663;

int cod(int in, int sf){
    return (s[sf] - (s[in-1] * put[sf - in  + 1]) % mod + mod) % mod;
}
int main(){

	freopen("reguli.in", "r", stdin);
	freopen("reguli.out", "w", stdout);
	int n, i;
	int p1 = 10, mod = 10000007;
	scanf("%d\n", &n);
	put[0] = 1;
	for(i = 1; i < n; i++){
        put[i] = ( p1 * put[i - 1] ) % mod;
	}
	for (i = 1; i <= n; i++) {
		scanf("%d\n", &x[i]);
	}
	for (int j = 2; j <= n/2; j++) {
		for (i = 2; i < n; i++) {
			if(i % j == 0){
				a[j] = x[i] - x[i-1];
			}else {
				a[i] = x[i] - x[i-1];
			}
		}
		//printf("%d:", j);
        /*for(i = 1; i < n; i++){
            printf("%d ", a[i]);
        }
        printf(" | | ");*/
		for(i = 1; i < n; i++){
            s[i] = (s[i - 1] * p1 + a[i]) % mod;
		}
		/*for(i = 1; i < n; i++){
            printf("%d ", s[i]);
        }
        printf("\n");*/
		int b = s[j];
		//printf("\n%d\n", b);
        int ebun = 1;
        for (i = 2; i < n && ebun == 1; i+=j-1) {
            int sa = cod(i, i + j - 2);
            //printf("%d %d: %d; %d\n", i, i + j - 2, b, sa);
            if(b != sa){
                ebun = 0;
            }
        }
        if(ebun == 1){
            printf("%d\n", j-1);
            for(i = 2; i <= j; i++){
                printf("%d\n", a[i]);
            }
            return 0;
        }
	}


	return 0;
}