#include<cstdio>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<set>
#include<algorithm>
#define maxn 22
using namespace std;
int main() {
string input, output;
cin >> input;
output = input;
int in = 0;
for (int i = output.size() - 1; i >= 0; i--) {
int a = (output[i] - '0') * 2 + in;
if (a > 9) {
output[i] = a % 10 + '0';
in = 1;
}
else {
output[i] = a + '0';
in = 0;
}
}
if (in == 1) {
printf("No\n");
cout << "1" << output << endl;
return 0;
}
vector<int> checkin(10), checkout(10);
for (int i = 0; i < 10; i++) {
checkin[i] = checkout[i] = 0;
}
for (int i = 0; i < input.size(); i++) {
int a = input[i] - '0';
checkin[a]++;
}
for (int i = 0; i < output.size(); i++) {
int a = output[i] - '0';
checkout[a]++;
}
if (checkin == checkout) printf("Yes\n");
else printf("No\n");
cout << output << endl;
}