#include <bits/stdc++.h>
int f[1001];
int p[169] = {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};
int cmp(const void *a, const void *b) { return *(int *)b - *(int *)a; }
int find(int x) {
  while (x != f[x]) x = f[x];
  return x;
}
int main() {
  char s[1001];
  int a[27];
  int b[1001];
  int i, j;
  int fa;
  char str[1001];
  while (scanf("%s", s) != EOF) {
    memset(a, 0, sizeof a);
    int l = strlen(s);
    for (i = 1; i <= l; i++) f[i] = i;
    for (i = 0; i < l; i++) a[s[i] - 97]++;
    for (i = 2; i <= l; i++) {
      for (j = i + i; j <= l; j += i) {
        fa = find(j);
        if (fa != j) {
          f[i] = fa;
        } else
          f[fa] = find(i);
      }
    }
    int sum = 0;
    memset(b, 0, sizeof b);
    for (i = 1; i <= l; i++) {
      b[f[i]]++;
      if (f[i] == i) sum++;
    }
    qsort(b, 1000, sizeof(b[0]), cmp);
    for (i = 0; i < 26; i++)
      if (a[i] >= b[0]) break;
    if (i == 26)
      printf("NO\n");
    else {
      printf("YES\n");
      for (j = 1; j <= l; j++)
        if (f[j] == 2) {
          str[j] = i + 97;
          a[i]--;
        }
      for (j = 1; j <= l; j++)
        if (f[j] != 2) {
          for (i = 0; i < 26; i++)
            if (a[i]) {
              str[j] = i + 97;
              a[i]--;
              break;
            }
        }
      for (i = 1; i <= l; i++) printf("%c", str[i]);
      printf("\n");
    }
  }
  return 0;
}
