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).
def check_pal(s):
    mid=int(len(s)/2)
    i=0
    j=len(s)-1
    while(i<=mid):
        if s[i]!=s[j]:
            return 0
        i+=1
        j-=1
    return 1
s=input()
k=int(input())
lb=int(len(s)/2)
i=0
flag=0
while(i<len(s)):
    check=check_pal(s[i:i+lb])
    if check==0:
        flag=1
        break
    i+=lb
if flag==0:
    print("YES")
else:
    print("NO")