Time limit
2s
Memory limit
128 MB
A cyclic word is made by writing a word around a circle. After choosing any position on the circle and reading clockwise, another linear word is obtained.
Two words are considered the same if one can be written in a circle and read from some starting position to obtain the other. For example, picture and turepic are the same word.
Given N words, count how many distinct words there are under this rule.
The first line contains the number of words N.
Each of the next N lines contains one word. Every word consists only of lowercase English letters.
N is a positive integer no greater than 50, and each word has length at most 50.
Print the number of distinct words.