You are given a non-empty string s of lowercase letters. Decide whether s can be built by taking some proper prefix of it (a prefix strictly shorter than s) and writing that prefix two or more times in a row.
Input format
A single line: the string s.
Output format
Print YES if s is a whole number of copies (at least two) of one of its proper prefixes, otherwise print NO.
Constraints
- 1 <= length of
s<= 100000 scontains only lowercase lettersa-z.