...

#include <cstdio>
int main()
{
 long t, i, j, mx;
 long a[ 1000000 ];
 long w;
 a[ 1 ]= 1 ;a[ 2 ]= 5 ;a[ 3 ]= 13 ;mx= 3 ;
 scanf("%d", &t);
 do
 {
  scanf("%d", &j);
  if (j > mx)
  {
   for (long i=mx+ 1 ;i=j;i++)
   {
    w=i;
    a[i]=a[i- 1 ]+( 2 *w- 1 )+((w*(w- 1 ))/ 2 );
    if ((i/ 2 * 2 -i)!= 0 ) 
    { 
     a[i]=a[i]+(((w- 3 )*(w- 1 ))/ 4 );
    }
    else
    {
     a[i]=a[i]+(((w- 2 )*(w- 2 ))/ 4 );
    }   
   } 
   mx=j;
  }

  printf("%d", a[j]);
  t--; 
   } while (t >  0 );
}

{$I-, Q-, R-, S-}
var t, i, j, mx: longint;
a: array[ 1 .. 1000000 ] of int64;
w: int64;
begin
   a[ 1 ] :=  1 ; a[ 2 ] :=  5 ; a[ 3 ] :=  13 ; mx :=  3 ;
   readln(t);

   repeat
     readln(j);
    
     if j > mx then begin
        
        for i := mx +  1  to j do begin
            w := i;
            a[i] := a[i- 1 ] + ( 2  * w -  1 ) + ((w * (w -  1 )) div  2 );
            if odd(i) then 
               a[i] := a[i] + (((w -  3 ) * (w -  1 )) div  4 ) 
            else
               a[i] := a[i] + (((w -  2 ) * (w -  2 )) div  4 );
        end;
        mx := j;

     end;
     writeln(a[j]);
     dec(t); 
   until t =  0 ;

end.

const ms =  1000000 ;
var
 M:array[ 0 ..ms- 1 ] of int64;
 pos,tc,lv,res:int64;
 sz,i:longint;
 begin

 for i:= 1  to ms- 1  do begin
  M[i]:=M[i- 1 ]+i;
 end;

 readln(tc);
 while(tc> 0 ) do begin

  readln(lv);
  res:= 0 ;

  for sz:= 1  to lv do begin
  
    pos:=lv-sz+ 1 ;
    if(pos> 0 )then res:=res+M[pos];
    
    pos:=lv- 2 *sz+ 1 ;
    if(pos> 0 )then res:=res+M[pos];

  end;
  writeln(res);
  tc:=tc- 1 ;
 end;
end.

printf("%lld",  128 * 256 * 256 * 256 )

- 2147483648