#include <bits/stdc++.h>
using namespace std;
int is[1010];
vector<pair<int, int> > a;
int b[30];
string ans;
int main() {
  string s;
  cin >> s;
  int n = s.size();
  for (int i = (2); i < (n + 1); ++i) {
    bool f = true;
    for (int j = (2); j < (i); ++j)
      if ((i % j) == 0) f = false;
    if (f) is[i] = 1;
  }
  for (int i = (0); i < (s.size()); ++i) b[s[i] - 'a']++;
  for (int i = (0); i < (26); ++i) a.push_back(make_pair(b[i], i));
  sort(a.rbegin(), a.rend());
  for (int i = (0); i < (s.size()); ++i) ans += '-';
  for (int i = (1); i < (ans.size()); ++i)
    if (is[i + 1]) {
      if (i + i + 2 <= n) {
        if (a[0].first > 0) {
          a[0].first--;
          ans[i] = a[0].second + 'a';
        } else {
          cout << "NO" << endl;
          return 0;
        }
      }
    } else {
      if (a[0].first > 0) {
        a[0].first--;
        ans[i] = a[0].second + 'a';
      } else {
        cout << "NO" << endl;
        return 0;
      }
    }
  for (int i = (0); i < (ans.size()); ++i)
    if (ans[i] == '-')
      for (int j = (0); j < (a.size()); ++j) {
        if (a[j].first > 0) {
          a[j].first--;
          ans[i] = a[j].second + 'a';
          break;
        }
      }
  cout << "YES" << endl << ans << endl;
  return 0;
}
