#include <bits/stdc++.h>

using ll = long long;
using ld = long double;
using namespace std;

vector<ll> z1;

ll sol = 0;
ll x;
vector<bool> hp;

void solve(ll pos, ll n, ll w)
{
    if (pos == n)
    {
        if (w > x && (sol == 0 || sol > w))
        {
            sol = w;
        }
        w = 0;
        return;
    }
    for (int i = 0; i < z1.size(); i++)
    {
        if (hp.at(i) == false)
        {
            hp.at(i) = true;
            w = w * 10 + z1.at(i);
            solve(pos + 1, n, w);
            hp.at(i) = false;
        }
    }
}

int main()
{

    cin >> x;

    ll ax;
    ax = x;
    while (ax > 0)
    {
        z1.push_back(ax % 10);
        hp.push_back(false);
        ax = ax / 10;
    }

    solve(0, z1.size(), 0);

    cout << sol << endl;
    return 0;
}