{"raw_statement":[{"iden":"statement","content":"You are given $n$ strings and required to find the length of the longest *perfect word*.\n\nA string $t$ is called a *perfect word*, if and only if every non-empty substring of $t$ appears in the given strings.\n\nA string $s$ is called a substring of $t$ if and only if it can be obtained by removing several (possibly zero) characters from the beginning or end of $t$.\n"},{"iden":"input","content":"The first line contains a single integer $n$ ($1 \\leq n \\leq 10 ^ 5$).\n\nEach of the next $n$ lines contains a string consisting of lowercase English letters.\n\nIt is guaranteed that the total length of the given strings is no more than $10 ^ 5$.\n"},{"iden":"output","content":"Output an integer, representing the length of the longest perfect word.\n"},{"iden":"note","content":"**Source**: The 2022 ICPC Asia Xi'an Regional Contest Problem G.\n\n**Author**: MonkeyKing."}],"translated_statement":null,"sample_group":[["4\na\nt\nb\nab\n","2\n"]],"show_order":[],"formal_statement":null,"simple_statement":null,"has_page_source":false}