考虑所有的换法,让高位的数尽量大。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXL (100000+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
char s[MAXL];
int main()
{
// freopen("Anton.in","r",stdin);
// freopen(".out","w",stdout);
scanf("%s",s+1);
int n=strlen(s+1);
For(i,n)
{
if ((s[i]-'0')%2==0&&s[i]<s[n])
{
swap(s[i],s[n]);
printf("%s",s+1);
return 0;
}
}
ForD(i,n)
{
if ((s[i]-'0')%2==0)
{
swap(s[i],s[n]);
printf("%s",s+1);
return 0;
}
}
cout<<"-1"<<endl;
return 0;
}