#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const long long MAX = 2005;
int primes[] = {2,   3,   5,   7,   11,  13,  17,  19,  23,  29,  31,  37,  41,
                43,  47,  53,  59,  61,  67,  71,  73,  79,  83,  89,  97,  101,
                103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167,
                173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239,
                241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313,
                317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397,
                401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467,
                479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569,
                571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643,
                647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733,
                739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823,
                827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911,
                919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};
vector<int> g[1005];
int comp[1005];
bool v[1005];
int sz[1005];
char ans[1005];
vector<int> ceach[1005];
int keys[200];
int ct;
int dfs(int st, int num) {
  ct++;
  ceach[num].push_back(st);
  comp[st] = num;
  v[st] = true;
  for (int i : g[st]) {
    if (!v[i]) {
      dfs(i, num);
    }
  }
  return ct;
}
void join(int i, int j) {
  g[i].push_back(j);
  g[j].push_back(i);
}
int main() {
  string st;
  cin >> st;
  int l = st.length();
  for (int p : primes) {
    for (int i = 2; i <= l / p; i++) {
      join(p, p * i);
    }
  }
  int cc = 0;
  for (int i = 1; i < l + 1; i++) {
    ct = 0;
    if (!v[i]) {
      cc++;
      int res = dfs(i, cc);
      sz[cc] = res;
    }
  }
  int k = 0;
  int kk = 0;
  for (int i = 1; i < cc + 1; i++) {
    if (sz[i] != 1) {
      k = sz[i];
      kk = i;
      break;
    }
  }
  int maxx = 0;
  char lett = 's';
  for (char i : st) {
    keys[i]++;
    if (keys[i] > maxx) {
      maxx = keys[i];
      lett = i;
    }
  }
  if (maxx < k) {
    cout << "NO" << endl;
    return 0;
  }
  keys[lett] -= maxx;
  for (int i : ceach[kk]) {
    ans[i] = lett;
  }
  int rem = maxx - k;
  int curr = 1;
  for (int a = 1; a < rem + 1; a++) {
    while (ans[curr] == lett) {
      curr++;
    }
    ans[curr] = lett;
  }
  string newx = "";
  for (char i : st) {
    if (i != lett) {
      newx += i;
    }
  }
  for (char i : newx) {
    while (ans[curr] == lett) {
      curr++;
    }
    ans[curr] = i;
    curr++;
  }
  cout << "YES" << endl;
  for (int i = 1; i < l + 1; i++) {
    cout << ans[i];
  }
}
