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).
#-------------------------------#
#INCLUDE <Amirhossein_Alimirzaei>
#INCLUDE <HajLorenzo>
#INCLUDE <ESSI.H>
#-------------------------------#
#--------------------#
#INCLUDE <HajLorenzo>
#INCLUDE <Dast_Garmi>
#INCLUDE <HAVE_FUN>
#--------------------#

s = input()
l = len(s)
k = int(input())
res = 1
if l % 2 == 0:
    s1 = s[:l//2]
    s2 = s[l//2:]
    if s1 == s1[::-1] and s2 == s2[::-1]:
        res = 0
print('YNEOS'[res::2])

