18544번 - Incomparable Pairs 다국어

You are given a string s = s₁s₂ . . . s_n. Consider an unordered pair of its substrings {a, b}. Let us call such pair incomparable if neither a is a substring of b nor b is a substring of a. You have to compute the number of incomparable pairs of substrings of s.

The first line of input contains a single string s consisting of lowercase English letters (1 ≤ |s| ≤ 10⁵).

Output a single integer which is the answer to the problem.