// This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get_int(T &x)
{
	char t=getchar();
	bool neg=false;
	x=0;
	for(; (t>'9'||t<'0')&&t!='-'; t=getchar());
	if(t=='-')neg=true,t=getchar();
	for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
	if(neg)x=-x;
}
template<typename T> void print_int(T x)
{
	if(x<0)putchar('-'),x=-x;
	short a[20]= {},sz=0;
	while(x>0)a[sz++]=x%10,x/=10;
	if(sz==0)putchar('0');
	for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) get1(a),get1(b)
#define get3(a,b,c) get1(a),get2(b,c)
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);

char s[20],a[20];
int n;
LL pw,ans;
char ord[20];

LL conv(char *s)
{
	LL ret=0;
	for(int i=0;i<n;i++)ret=ret*10+s[i]-'0';
	return ret;
}
int main()
{
	scanf("%s",s);
	n=strlen(s);pw=1;for(int i=1;i<=n;i++)pw*=10;
	for(int i=0;i<10;i++)ord[i]=i+'0';
	LL t1=conv(s);
//	printendl(t1);
	do
	{
		LL t2=abs(t1-conv(ord));
		t2=min(t2,pw-t2);
		if(t2>ans)
		{
			ans=t2;
			for(int i=0;i<n;i++)a[i]=ord[i];
		}
	}while(next_permutation(ord,ord+10));
//	printendl(ans);
	for(int i=0;i<n;i++)putchar(a[i]);
	puts("");
	return 0;
}
### Prompt

Develop a solution in Cpp to the problem described below:

Example

Input

201


Output

701

### Response

```cpp
// This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get_int(T &x)
{
	char t=getchar();
	bool neg=false;
	x=0;
	for(; (t>'9'||t<'0')&&t!='-'; t=getchar());
	if(t=='-')neg=true,t=getchar();
	for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
	if(neg)x=-x;
}
template<typename T> void print_int(T x)
{
	if(x<0)putchar('-'),x=-x;
	short a[20]= {},sz=0;
	while(x>0)a[sz++]=x%10,x/=10;
	if(sz==0)putchar('0');
	for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) get1(a),get1(b)
#define get3(a,b,c) get1(a),get2(b,c)
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);

char s[20],a[20];
int n;
LL pw,ans;
char ord[20];

LL conv(char *s)
{
	LL ret=0;
	for(int i=0;i<n;i++)ret=ret*10+s[i]-'0';
	return ret;
}
int main()
{
	scanf("%s",s);
	n=strlen(s);pw=1;for(int i=1;i<=n;i++)pw*=10;
	for(int i=0;i<10;i++)ord[i]=i+'0';
	LL t1=conv(s);
//	printendl(t1);
	do
	{
		LL t2=abs(t1-conv(ord));
		t2=min(t2,pw-t2);
		if(t2>ans)
		{
			ans=t2;
			for(int i=0;i<n;i++)a[i]=ord[i];
		}
	}while(next_permutation(ord,ord+10));
//	printendl(ans);
	for(int i=0;i<n;i++)putchar(a[i]);
	puts("");
	return 0;
}
```