#include <bits/stdc++.h>
using namespace std;
char str[1005];
int cnt[30];
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};
void Readinput() { scanf("%s", str); }
void solve() {
  int i, j;
  int len = strlen(str);
  for (i = 0; i < len; i++) cnt[str[i] - 'a']++;
  int k = (len / 2) + 1;
  int ans = 0;
  for (i = 0; primes[i] <= len; i++) {
    if (primes[i] >= k) ans++;
  }
  for (i = 0; i < 26; i++)
    if (cnt[i] >= len - ans - 1) break;
  if (i >= 26)
    printf("NO\n");
  else {
    printf("YES\n");
    char temp[len + 1];
    memset(temp, i + 'a', sizeof(temp));
    cnt[i] -= len - ans - 1;
    j = 0;
    for (i = 0; i < 26; i++) {
      if (cnt[i]) {
        temp[0] = i + 'a';
        cnt[i]--;
        break;
      }
    }
    for (i = 0; primes[i] <= len; i++) {
      if (primes[i] >= k) {
        while (cnt[j] == 0) j++;
        temp[primes[i] - 1] = j + 'a';
        cnt[j]--;
      }
    }
    temp[len] = '\0';
    printf("%s\n", temp);
  }
}
int main() {
  Readinput();
  solve();
  return 0;
}
