#include <bits/stdc++.h>
using namespace std;
char s[1011];
int n, cnt[1011];
bool ok[1011], prime[1011];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  for (int i = 1; i <= n; i++) cnt[s[i] - 'a']++;
  for (int i = 2; i <= n; i++) prime[i] = 1;
  for (int i = 2; i <= n; i++)
    for (int j = i + i; j <= n; j += i) prime[j] = 0;
  for (int i = 1; i <= n; i++) ok[i] = (i > 1 && (i + i <= n || !prime[i]));
  int tot = 0, v = max_element(cnt, cnt + 26) - cnt;
  for (int i = 1; i <= n; i++) tot += ok[i];
  if (tot > cnt[v])
    puts("NO");
  else {
    puts("YES");
    int cur = 0;
    cnt[v] -= tot;
    for (int i = 1; i <= n; i++) {
      if (ok[i])
        putchar(v + 'a');
      else {
        while (!cnt[cur]) cur++;
        if (cnt[cur]) {
          putchar(cur + 'a');
          cnt[cur]--;
        }
      }
    }
  }
  return 0;
}
