program Koba;{preONI 2008 runda 4- solutia optimizata}
var x:array[1..10000]of 0..999;
   f,g:text;
   n,a,b,c,d,s,sum,i,np,k,y,j:longint;
begin
assign(f,'koba.in');reset(f);
assign(g,'koba.out');rewrite(g);
readln(f,n,a,b,c);
a:=a mod 10; b:=b mod 10; c:=c mod 10;
s:=a;
x[1]:=a*100+b*10+c;
for i:=2 to n do
  begin
  d:=(c+b*a) mod 10;
  a:=b;b:=c;c:=d;
  y:=a*100+b*10+c;
  j:=1;
  while (x[j]<>y) and (j<=i-1) do
      j:=j+1;
  if x[j]<>y then begin s:=s+a;x[i]:=y;end
             else begin
                  sum:=0;
                  for k:=j to i-1 do
                    sum:=sum+x[k] div 100;
                  np:=i-j;
                  s:=s+((n-i+1) div np) *sum;
                  for k:=1 to (n-i+1) mod np do
                     s:=s+x[j+k-1] div 100;
                  break;
                  end;
    end;
write(g,s);
close(f);close(g);
end.