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).
s = input()
k = int(input())

l = []
startIndex = 0
endIndex = int(len(s)/k)

for i in range(k):
    l.append(s[startIndex:endIndex])
    startIndex = endIndex
    endIndex = endIndex * 2

is_him = True

if len(s) % k != 0:
    is_him = False

for i in range(k):
    if l[i] != l[i][::-1]:
        is_him = False
        break

print('YES' if is_him else 'NO')