#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstdio>

using namespace std;

int main()
{
    //freopen("nextvector.in","r",stdin);
    //freopen("nextvector.out","w",stdout);
    long long i, des, kol;
    string n, sled, pred;
    cin >> n;
    kol = n.size();
    for (i = 0; i <n.size(); i++)
    {
        sled[i] = n[i];
        pred[i] = n[i];
    }
    for (i = sled.size()-1; i >= 0; i --)
    {
        if (sled[i] == '0')
        {
            sled[i] = '1';
            for (long long j = sled.size()-1; j > i; j --)
            {
               sled[j] = '0';
               des = 1;
               break;
            }
        }
        if (des == 1)
        {
            break;
        }
    }
    des = 0;
    for (i = pred.size()-1; i >= 0; i --)
    {
        if (pred[i] == '1')
        {
            pred[i] = '0';
            for (long long j = sled.size()-1; j > i; j --)
            {
               pred[j] = '1';
               des = 1;
               break;
            }
        }
        if (des == 1)
        {
            break;
        }
    }
    if (n[0] == '0')
    {
        cout << '-' << endl << '1';
    }
    else
    {
        if (sled.size() > kol)
        {
            cout << pred << endl << '-';
        }
        else
        {
            if (pred.size() < kol)
            {
                cout << '-' << endl << sled;
            }
            else
            {
                cout << pred << endl << sled;
            }
        }
    }
return 0;
}