const maxn=10005;
var
  n,m,l,r,i:longint;
  sum,a,h:array [0..maxn] of longint;

begin
  readln(n);
  fillchar(h,sizeof(h),255);
  h[0]:=0;
  for i:=1 to n do
    begin
      read(a[i]);
      sum[i]:=(sum[i-1]+a[i]) mod n;
      if h[sum[i]]=-1 then h[sum[i]]:=i
      else
        begin
          l:=h[sum[i]];
          r:=i;
        end;
    end;
  writeln(r-l);
  for i:=l+1 to r do writeln(a[i]);
end.