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).
# Description of the problem can be found at http://codeforces.com/problemset/problem/548/A

def is_pal(s, l, h):
    while l < h:
        if s[l] != s[h]:
            return False
        l += 1
        h -= 1
    
    return True

s = input()
k = int(input())
l = 0
h = len(s) // k - 1

while h < len(s):
    if not is_pal(s, l, h):
        print("NO")
        quit()
    
    l = h + 1
    h += len(s) // k

print("YES")