#include <bits/stdc++.h>
using namespace std;
const long long int maxn = 2 * 1e6 + 5;
const long long int modn = 1e9 + 7;
long long int Z, len, part;
string inp;
long long int all[maxn];
bool is_pal(long long int L, long long int R) {
  while (R > L) {
    if (inp[L] != inp[R]) return false;
    L++;
    R--;
  }
  return true;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin >> inp >> part;
  if (inp.size() % part != 0) {
    cout << "NO";
    return 0;
  }
  part = inp.size() / part;
  for (int i = 1; i <= inp.size(); i += part) {
    if (is_pal(i - 1, i + part - 2) == false) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES";
  return 0;
}
