Problem:
Score : 200 points

Problem Statement

Given are a positive integer N and a string S of length N consisting of lowercase English letters.

Determine 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.

Constraints

1 \leq N \leq 100

S consists of lowercase English letters.

|S| = N

Input

Input is given from Standard Input in the following format:

N
S

Output

If S is a concatenation of two copies of some string, print Yes; otherwise, print No.

Sample Input 1

6
abcabc

Sample Output 1

Yes

Let T = abc, and S = T + T.

Sample Input 2

6
abcadc

Sample Output 2

No

Sample Input 3

1
z

Sample Output 3

No

Solution in Rust (1.15.1) (judge verdict: Accepted)

use std::io;
use std::io::prelude::*;

fn main() {
    let stdin = io::stdin();
    let mut vec = Vec::new();
    for line in stdin.lock().lines() {
        vec.push(line.unwrap())
    }

    let n: usize = vec[0].parse().unwrap();
    let s = &vec[1];

    if n % 2 != 0 {
        println!("No");
        return
    }

    let m = n / 2;

    let former = &s[..m];
    let latter = &s[m..];
        
    if former == latter {
        println!("Yes");
    } else {
        println!("No");
    }
}