PAT-A1023

#include<stdio.h>
#include<string.h>
struct big{
	int d[1010] , len;
	big(){
		len=0;
		memset(d,0,sizeof(d));
	}
};
big change(char a[]){
	int i,len;
	len=strlen(a);
	big c;
	for(i=0;i<len;i++){
		c.len=len;
		c.d[i]=a[len-i-1]-'0';
	}
	return c;
}
big divide(big a,int b,int &r){
	int i;
	big e;
	e.len=a.len;
	for(i=a.len-1;i>=0;i--){
		if((a.d[i]+r*10)>=b){e.d[i]=(a.d[i]+r*10)/b;r=(a.d[i]+r*10)%b;}
		else {e.d[i]=0;r=(a.d[i]+r*10)+r;}
	}
	while(e.len>1&&e.d[e.len-1]==0)e.len--;
	return e;
}
big multi(big a){
	int i, carry=0;
	big b;
	b.len=a.len;
	for(i=0;i<a.len;i++){
		b.d[i]=(a.d[i]*2+carry)%10;
		if(a.d[i]*2+carry>9)carry=1;
		else carry=0;
	}
	if(carry==1)b.d[b.len++]=1;
	return b;
}
void show(big a){
	for(int i=a.len-1;i>=0;i--)printf("%d",a.d[i]);
}
int main(){
int i, len, r=0, flag[10]={0};
char data[1010];
scanf("%s",data);
len=strlen(data);
for(i=0;i<len;i++)flag[data[i]-'0']++;

big d=multi(change(data));
for(i=0;i<d.len;i++)	flag[d.d[i]]--;
for(i=0;i<10;i++)if(flag[i]!=0){printf("No\n");break;}
if(i==10)printf("Yes\n");
show(d);
//printf(" %d\n",r);
return 0;
}