Problem:
Score : 500 points

Problem Statement

Given is a string S of length N.

Find the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping.

More formally, find the maximum positive integer len such that there exist integers l_1 and l_2 ( 1 \leq l_1, l_2 \leq N - len + 1 ) that satisfy the following:

l_1 + len \leq l_2

S[l_1+i] = S[l_2+i] (i = 0, 1, ..., len - 1)

If there is no such integer len, print 0.

Constraints

2 \leq N \leq 5 \times 10^3

|S| = N

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the maximum length of a non-empty string that occurs twice or more in S as contiguous substrings without overlapping. If there is no such non-empty string, print 0 instead.

Sample Input 1

5
ababa

Sample Output 1

2

The strings satisfying the conditions are: a, b, ab, and ba. The maximum length among them is 2, which is the answer.
Note that aba occurs twice in S as contiguous substrings, but there is no pair of integers l_1 and l_2 mentioned in the statement such that l_1 + len \leq l_2.

Sample Input 2

2
xy

Sample Output 2

0

No non-empty string satisfies the conditions.

Sample Input 3

13
strangeorange

Sample Output 3

5

Solution in Fortran (gfortran v4.8.4) (judge verdict: Wrong Answer)

integer N
character(5000) S

integer,allocatable,dimension(:)::seen1,seen2
integer mod1,mod2
integer base1,base2
integer(16) rh1,rh2
integer,allocatable,dimension(:)::pow1,pow2

integer ok,ng,md
logical mdcheck

integer i

read*,N
read*,S
mod1=30203
mod2=30211
allocate(seen1(0:mod1-1),seen2(0:mod2-1))
base1=4051
base2=359
allocate(pow1(0:N),pow2(0:N))
pow1(0)=1;pow2(0)=1
do i=1,N
  pow1(i)=mod(pow1(i-1)*base1,mod1)
  pow2(i)=mod(pow2(i-1)*base2,mod2)
end do

ok=0;ng=N/2+1
md=(ok+ng)/2
do while(ng-ok>1)
  mdcheck=.false.
  
  seen1=-1;seen2=-1
  rh1=0;rh2=0
  do i=1,md
    rh1=mod(rh1+ichar(S(i:i))*pow1(md-i),mod1)
    rh2=mod(rh2+ichar(S(i:i))*pow2(md-i),mod2)
  end do
  seen1(rh1)=1;seen2(rh2)=1
  do i=2,N-md+1
    rh1=mod(mod(rh1*base1,mod1)+ichar(S(i+md-1:i+md-1))-mod(ichar(S(i-1:i-1))*pow1(md),mod1),mod1)
    rh2=mod(mod(rh2*base2,mod2)+ichar(S(i+md-1:i+md-1))-mod(ichar(S(i-1:i-1))*pow2(md),mod2),mod2)
	if(rh1<0)rh1=rh1+mod1
    if(rh2<0)rh2=rh2+mod2
    if(seen1(rh1)>0 .and. seen2(rh2)>0)then
      if(i-seen1(rh1)>=md .and. i-seen2(rh2)>=md)then
        mdcheck=.true.
        exit
      endif
    else
      seen1(rh1)=i;seen2(rh2)=i
    endif
  end do
  if(mdcheck)then
    ok=md
  else
    ng=md
  endif
  md=(ok+ng)/2
end do

print"(I0)",ok
end