/VDSEQ02 - Dãy số chia hết

              Uses Crt;
        Var n,k,i,j,max:longint; a,f:array[0..100000] of int64;
        Begin
            readln(n,k);
            f[0]:=0;
            for i:=1 to n do
            begin
                readln(a[i]);
                f[i]:=f[i-1]+a[i];
            end;
            max:=0;
            for i:=0 to n do begin if n-i<=max then break;
            for j:=max+i to n do
            if (f[j]-f[i]) mod k=0 then
            if j-i>max then begin max:=j-i; end;
            end;
        
            writeln(max);
        
            readln;
        End.