#include<cstdio>
#include<iostream>
#include<vector>
#include <cstring>
using namespace std;


long long int n,m,k,i,j,p,x,y,a[10005],b[10005] ,t,sol;



int main()
{
    //freopen("b.in","r",stdin);
    //freopen("b.out","w",stdout);

    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
        a[i] = a[i] + a[i-1];
    }
    for(i=1;i<=n;i++)
    {
        scanf("%lld",&b[i]);
        b[i] = b[i] + b[i-1];
    }
    sol=0;
    for(k=n;k>=1 and sol == 0;k--)
    {
        for(i=1;i<=n-k+1 and sol == 0;i++)
        {
            if( (a[i+k-1]- a[i-1]) == (b[i+k-1]- b[i-1]) )
            {
                sol = k;
            }
            //printf("%lld %lld %lld %lld\n",i,i+k-1,a[i+k-1]-a[i-1],b[i+k-1]-b[i-1]);
        }
    }
    printf("%lld\n",sol);

    for(i=1;i<=n;i++)
    {
        printf("%lld ",a[i]);
    }


}