Anton and currency you all know

D - Anton and currency you all know
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 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

先说一说这个题的题意，就是让两个数改变位置，让这个数字变成偶数，使这样的数字是最大的。
我想弄一个变量，让这个变量称为最后的一个偶数的，然后从第一个进行历练，如果这个数是偶数然后这个数比最后的一个数要打那么就改变break，因为让最高的一位变成比以前大的这样就更大，如果所有的数都不行那就让最后的偶数与最后一位改变。总结起来就是一句话，如果大就更大，如果小就尽量接近这个原来的数。
再说一下-1的情况下，就是所有的都是素数的话就可以了。

#include <iostream>
#include <cstring>
using namespace std;
int main()
{
    char ch[100100];
    cin>>ch;
    int t=strlen(ch),ans=0,n;
    for(int i=0;i<t;i++)
    {
        int m=ch[i]-'0';
        if((m&1)==1)
            ans++;
        else  n=i;
    }
    if(ans==t)
    {
        cout<<"-1"<<endl;
        return 0;
    }
    for(int i=0;i<t;i++)
    {
        int m=ch[i]-'0';
        if((m&1)==0&&ch[i]<ch[t-1])
        {
            swap(ch[i],ch[t-1]);
            break;
        }
        else if(i==n)
        {
            swap(ch[i],ch[t-1]);
            break;
        }
    }
    for(int i=0;i<t;i++)
        cout<<ch[i];
    return 0;
}