Given a string . We call any non-empty string good, if it is a substring of and has 4 non-overlapping occurrences in . Your task is to find the number of different good strings.
Contains one string — given string. It is guaranteed that all letters are lowercase English alphabet.
Print one integer — the number of different good strings.