While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He concatenated these strings in some order and now he has string *s*.

He is not sure if this is his own back-bag or someone else's. He remembered that there were exactly *k* messages in his own bag, each was a palindrome string and all those strings had the same length.

He asked you to help him and tell him if he has worn his own back-bag. Check if the given string *s* is a concatenation of *k* palindromes of the same length.
The first line of input contains string *s* containing lowercase English letters (1 ≤ |*s*| ≤ 1000).

The second line contains integer *k* (1 ≤ *k* ≤ 1000).
#!/usr/bin/env python3
import sys

S = input()
K = int(input())

def is_palindrome(s):
    return s == s[::-1]

def split_string(s, length):
    if len(s) == 0:
        return []
    else:
        return [s[:length]] + split_string(s[length:], length)

if len(S) % K != 0:
    print("NO")
else:
    length = int(len(S) / K)
    for substr in split_string(S, length):
        if not is_palindrome(substr):
            print("NO")
            sys.exit(0)
    print("YES")