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())
if k==1:
    print('YES')
elif len(s)%k!=0:
    print('NO')
else:
    t = [0]*26
    for i in s:
        t[ord(i)-97]+=1
    if k%2==0:
        f = True
        for i in t:
            if i%2!=0:
                f = False
                break
        if f:
            print('YES')
        else:
            print('NO')
    else:
        f = True
        for i in t:
            if i%2!=0 and i%3!=0:
                f = False
        if f:
            print('YES')
        else:
            print('NO')