#include <cstdio>

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

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

	freopen("reguli.in", "r", stdin);
	freopen("reguli.out", "w", stdout);
	int n, i;
	int p1 = 1327, mod = 10000007;
	scanf("%d\n", &n);
	pp[0] = 1;
	for(i = 1; i < n; i++){
        pp[x] = (p1 * pp[x - 1]) % mod;
	}
	for (i = 0; i < n; i++) {
		scanf("%d\n", &x[i]);
	}
	for (int j = 1; j < n; j++) {
		for (i = 1; i < n; i++) {
			if(i % j == 0){
				a[j] = x[i] - x[i-1];
			}else {
				a[i] = x[i] - x[i-1];
			}
		}

		for(i = 2; i < n; i++){
            s[i] = (s[i - 1] * p1 + a[i]) % mod;
		}
		int b = s[j];

	}
    int ebun = 1;
	for (i = j + 1; i < n && ebun == 1; i+=j) {
		sa = cod(i, i + j - 1);
		if(b != sa){
            ebun = 0;
		}
	}
	if(ebun == 1){
        printf("%d\n", j);
        for(i = 1; i < j; i++){
            printf("%d\n", a[i]);
        }
        return 0;
	}

	return 0;
}