#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1e+9 + 7;
// constexpr int mod = 998244353;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s;
    cin >> s;
    int n = s.length();
    vector<char> c;
    for(int i = 0; i < n; ++i)  c.emplace_back(s[i]);
    sort(c.begin(), c.end(), greater<char>());
    vector<char> uni = c;
    uni.erase(unique(uni.begin(), uni.end()), uni.end());
    if(uni.size() == 1){
        cout << -1 << endl;
        return 0;
    }
    int pos;
    int sz = c.size();
    for(int i = sz - 1; i >= 0; --i){
        if(c[i] == uni.back())  continue;
        pos = i;
        break;
    }
    swap(c[pos], c[pos + 1]);
    if(c[0] == '0'){
        cout << -1 << endl;
        return 0;
    }
    for(int i = 0; i < sz; ++i) cout << c[i];
    cout << endl;
}