{"raw_statement":[{"iden":"problem statement","content":"Given are a positive integer $N$ and a string $S$ of length $N$ consisting of lowercase English letters.\nDetermine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string $T$ such that $S = T + T$."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 100$\n*   $S$ consists of lowercase English letters.\n*   $|S| = N$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$S$"},{"iden":"sample input 1","content":"6\nabcabc"},{"iden":"sample output 1","content":"Yes\n\nLet $T = $ `abc`, and $S = T + T$."},{"iden":"sample input 2","content":"6\nabcadc"},{"iden":"sample output 2","content":"No"},{"iden":"sample input 3","content":"1\nz"},{"iden":"sample output 3","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}