Codeforces Round #288 (Div. 二) Anton and currency you all know

 Anton and currency you all know

Time Limit:500MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Description

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 odd positive integer n. Help Anton to determine the exchange rate ofcurrency 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.

Sample Input

Input

527

Output

572

Input

4573

Output

3574

Input

1357997531

Output

-1

题目大意：一个基数整数，个位上数字与其他某一位上数字交换得到一个最小的偶数，如果这个偶数存在，输出之，否则输出-1。

解题思路：从最高位开始往后，找到一个比各位数字大的偶数，交换，即能保证交换后得到最小偶数。

代码如下：

#include <cstdio>
#include <cstring>
int a[100005];
char s[100005];
int main()
{
    int len,i,even=-1;
    scanf("%s",s);
    len=strlen(s);
        for(i=0;i<len;i++)
            a[i]=s[i]-'0';
		for(i=0;i<len;i++)
        {
            if(a[i]%2==0)
			{
                even=i;
				if(a[i]<a[len-1])
					break;
			}
        }
        if(even==-1)
		{
            printf("-1\n");
			return 0;
		}
		int tm=a[len-1];
		a[len-1]=a[even];
		a[even]=tm;
        for(i=0;i<len;i++)
			printf("%d",a[i]);
		printf("\n");
    return 0;
}