【Anton and currency you all know】【CodeForces - 508B 】（思维）

题目:

Berland, 2016. The exchange rate of currency you all know against the burle has increased so much that to simplify the calculations, its fractional part was neglected and the exchange rate is now assumed to be an integer.

Reliable sources have informed the financier Anton of some information about the exchange rate of currency you all know against the burle for tomorrow. Now Anton knows that tomorrow the exchange rate will be an even number, which can be obtained from the present rate by swapping exactly two distinct digits in it. Of all the possible values that meet these conditions, the exchange rate for tomorrow will be the maximum possible. It is guaranteed that today the exchange rate is an oddpositive integer n. Help Anton to determine the exchange rate of currency you all know for tomorrow!

Input

The first line contains an odd positive integer n — the exchange rate of currency you all know for today. The length of number n's representation is within range from 2 to 105, inclusive. The representation of n doesn't contain any leading zeroes.

Output

If the information about tomorrow's exchange rate is inconsistent, that is, there is no integer that meets the condition, print  - 1.

Otherwise, print the exchange rate of currency you all know against the burle for tomorrow. This should be the maximum possible number of those that are even and that are obtained from today's exchange rate by swapping exactly two digits. Exchange rate representation should not contain leading zeroes.

Examples

Input

527

Output

572

Input

4573

Output

3574

Input

1357997531

Output

-1

 

解题报告：给咱们一个n，咱们可以交换其中的两位，使得n转换为最大的偶数存在。解题思路就是先从头开始遍历寻找小于最尾部的数字的偶数，如果有的话，二者交换，如果存在偶数但是均大于尾部数字的话，咱们就交换首位和尾位，如果根本不存在偶数的话，直接输出-1.

ac代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;

const int maxn=1e6+10;
char str[maxn];

int main()
{
	scanf("%s",str);
	int flag=0;
	int pos=-1;
	int len=strlen(str);
	for(int i=0;i<len;i++)
	{
		if((str[i]-'0')%2==0)
		{
			pos=i;
			if(str[i]<str[len-1])
			{
				flag=1;
				swap(str[i],str[len-1]);
				break;	
			}
		}	
	}	
	if(!flag)
	{
		swap(str[pos],str[len-1]);
	}
	if(pos==-1)
		printf("-1\n");
	else
		printf("%s\n",str); 
}