3906: You're Given a String
金币值：2
定数：1
时间限制：2.000 s
内存限制：256 M
正确：0
提交：0
正确率：0.00% 命题人：
题目描述
time limit per test
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputYou're given a string of lower-case Latin letters. Your task is to find the length of its longest substring that can be met in the string at least twice. These occurrences can overlap (see sample test 2).
Input
The first input line contains the string. It's guaranteed, that the string is non-empty, consists of lower-case Latin letters, and its length doesn't exceed 100.
Output
Output one number − length of the longest substring that can be met in the string at least twice.
Examples
Input
abcd
Output
0
Input
ababa
Output
3
Input
zzz
Output
2