Repeating Sub-Sequence

Given a string A, find length of the longest repeating sub-sequence such that the two subsequence don’t have same string character at same position,

i.e., any i’th character in the two subsequences shouldn’t have the same index in the original string.

NOTE: Sub-sequence length should be greater than or equal to 2.

1 <= |A| <= 100

The first and the only argument of input contains a string A.

Return an integer, 0 or 1:

    => 0 : False
    => 1 : True

Input 1:

 A = "abab"

Input 2:

 A = "abba"

Output 1:

 1

Output 2:

 0

Explanation 1:

 "ab" is repeated.

Explanation 2:

 There is no repeating subsequence.