#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
string s;
bool prime[maxn + 1];
bool is[maxn + 1];
int n[maxn + 1];
char nofbig;
int main() {
  for (int i = 2; i <= 1000; ++i) prime[i] = true;
  for (int i = 2; i <= 1000; ++i) {
    if (prime[i]) {
      for (int j = 2; j * i <= 1000; ++j) {
        prime[i * j] = false;
      }
    }
  }
  cin >> s;
  for (int i = 0; i < (int)s.size(); ++i) {
    n[int(s[i] - 'a')]++;
  }
  int biggest = 0;
  for (int i = 'a'; i <= 'z'; ++i) {
    if (n[i - 'a'] > biggest) {
      biggest = n[i - 'a'];
      nofbig = char(i);
    }
  }
  int n2 = s.size();
  string ans = s;
  for (int i = 1; i <= n2; ++i) {
    if ((prime[i] && i <= n2 / 2) || (!prime[i] && i != 1)) {
      --biggest;
      ans[i - 1] = nofbig;
      if (biggest < 0) {
        cout << "NO" << endl;
        return 0;
      }
    } else {
      bool flag = false;
      for (int j = 'a'; j <= 'z'; ++j) {
        if (int(nofbig) != j && n[j - 'a'] > 0) {
          --n[j - 'a'];
          ans[i - 1] = char(j);
          flag = true;
          break;
        }
      }
      if (!flag) {
        --biggest;
        ans[i - 1] = nofbig;
        if (biggest < 0) {
          cout << "NO" << endl;
          return 0;
        }
      }
    }
  }
  cout << "YES" << endl;
  cout << ans << endl;
  return 0;
}
