#include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
	re int t=0;re char v=getchar();
	while(v<'0')v=getchar();
	while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
	return t;
}
const int M=998244353;
inline void add(re int &x,re int y){(x+=y)>=M?x-=M:x;}
inline int Mod(re int x){return x>=M?x-M:x;}
inline int ksm(re int x,re int y){
	re int s=1;
	while(y){
		if(y&1)s=1ll*s*x%M;
		x=1ll*x*x%M,y>>=1;
	}
	return s;
}
int t,n,m,a[1000002],ans,A,B,R[1000002],stk[1000002],tp,num[26];
char s[1000002];
int main(){
	scanf("%s",s+1),n=strlen(s+1);
	for(re int i=1;i<=n;++i)++num[s[i]-'a'];
	for(re int i=0;i<26;++i)if(num[i]==n)return puts("NO"),0;
	if(n==2)return printf("YES\n%s",s+1),0;
	for(re int i=0;i<26;++i)if(num[i]==n-1)return puts("NO"),0;
	for(re int i=0;i<26;++i)
		for(re int j=0;j<26;++j)
			if(num[i]==2&&num[j]==n-2&&n>4)
				return puts("NO"),0;
	puts("YES");
	for(re int i=0;i<26;++i)if(num[i]>=(n>>1)){
		for(re int j=1;j<=(n>>1);++j)putchar(i+'a'),--num[i];
		for(re int j=0;j<26;++j)if(j!=i&&num[j]){putchar(j+'a'),--num[j];break;}
		while(num[i])putchar(i+'a'),--num[i];
	}	
	for(re int j=0;j<26;++j)while(num[j])putchar(j+'a'),--num[j];
}