- #include<stdio.h>
- int main(void)
- { int n, i, j, a[17];
- int M[17][17];
- scanf("%d", &n);
- for (i=1; i<=2*n-1; ++i)
- scanf("%d", &a[i]);
- for(i=1; i<=n; ++i)
- for(j=1; j<=n; ++j)
- { if(i>j) M[i][j]=0;
- if(i==1) M[i][j]=a[j];
- if(j==n) M[i][n-1]=a[n-1+i];
- }
- for(i=2; i<=n-1; ++i)
- for(j=n-1; j>=2; --j)
- if(i<j) M[i][j]=((2*(M[i-1][j]-6*M[i][j+1]))%12151413);
- for (i=1; i<=n; ++i)
- printf("%d ", M[i][i]);
- return 0;
- }
