#include <bits/stdc++.h>
using namespace std;
bool prime(int p) {
  if (p == 1) return false;
  for (int i = 2; i * i <= p; ++i)
    if (p % i == 0) return false;
  return true;
}
int main() {
  vector<int> a(26);
  for (int i = 0; i < 26; ++i) a[i] = 0;
  string s;
  cin >> s;
  int n = s.size();
  int r = 1;
  for (int i = (n / 2) + 1; i <= n; ++i)
    if (prime(i)) ++r;
  for (int i = 0; i < n; ++i) ++a[int(s[i]) - 97];
  int k = 0, ind;
  for (int i = 0; i < 26; ++i)
    if (k < a[i]) {
      k = a[i];
      ind = i;
    }
  if (k < n - r) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  a[ind] -= (n - r);
  for (int j = 0; j < 26; ++j)
    if (a[j]) {
      cout << char(j + 97);
      --a[j];
      break;
    }
  for (int i = 2; i <= (n / 2); ++i) cout << char(ind + 97);
  if (n > 1)
    for (int i = (n / 2) + 1; i <= n; ++i) {
      if (prime(i)) {
        for (int j = 0; j < 26; ++j)
          if (a[j]) {
            cout << char(j + 97);
            --a[j];
            break;
          }
      } else
        cout << char(ind + 97);
    }
}
