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).
#In the name of Allah

from sys import stdin, stdout
input = stdin.readline

s = input()[:-1]
k = int(input())
n = len(s)

cnt = [0] * 26

l = ord("a")
r = ord("z")
for i in s:
         cnt[ord(i) - l] += 1

if n % k != 0:
         stdout.write("NO")
         
elif (n / k) % 2 != 0:
         for i in cnt:
                  k -= i % 2
         if k % 2 == 0:
                  stdout.write("YES")
         else:
                  stdout.write("NO")

else:
         for i in cnt:
                  if i % 2 != 0:
                           stdout.write("NO")
                           exit(0)
         stdout.write("YES")
