#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

bool check(string s, string t)
{
	string ct = t;
	sort(ALL(s));
	sort(ALL(ct));
	
	if (s != ct)
		return false;
	set<string> st;
	int n = SZ(t) / 2;
	t += t;
	FOR (i, 0, 2 * n)
	{
		st.insert(t.substr(i, n));
	}
	return SZ(st) == 2 * n;
}

bool checkNo(string s)
{
	int n = SZ(s);
	VI idx(n);
	iota(ALL(idx), 0);
	do
	{
		string t = "";
		for (auto i : idx)
			t += s[i];
		if (check(s, t))
			return false;
	} while (next_permutation(ALL(idx)));
	return true;
}


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	string s;
	cin >> s;
	int n = SZ(s) / 2;
	map<char, int> m;
	for (auto c : s)
		m[c]++;
	vector<pair<int, char>> v;
	for (auto [c, cnt] : m)
		v.PB({cnt, c});
	sort(ALL(v));
	string ans = "";
	if (SZ(v) >= 3)
	{
		cout << "YES\n";
		string t = "";
		FOR (i, 2, SZ(v))
			FOR (j, 0, v[i].F)
				t += v[i].S;
	//	cerr << t << '\n';
		FOR (i, 0, v[0].F)
			ans += v[0].S;
		FOR (i, 0, n - v[0].F)
			ans += t[i];
		FOR (i, 0, v[1].F)
			ans += v[1].S;
		FOR (i, 0, n - v[1].F)
			ans += t[i + (n - v[0].F)];
	}
	else if (SZ(v) == 1)
	{
		cout << "NO\n";
		//assert(checkNo(s));
		return 0;
	}
	else
	{
		if (v[0].F <= 2 && (n > 2 || (n == 2 && v[0].F == 1)))
		{
			cout << "NO\n";
			//assert(checkNo(s));
			return 0;
		}
		else if (n <= 2)
		{
			sort(ALL(s));
			cout << "YES\n";
			ans = s;
		}
		else
		{
			cout << "YES\n";
			ans += v[0].S;
			FOR (i, 0, n - 1)
				ans += v[1].S;
			FOR (i, 0, v[0].F - 1)
				ans += v[0].S;
			FOR (i, 0, v[1].F - n + 1)
				ans += v[1].S;
		}
	}
	//cerr << s << ' ' << ans << '\n';
	//assert(check(s, ans));
	cout << ans << '\n';
	
	return 0;
}