#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const int inf = numeric_limits<int>::max();
const ll inff = numeric_limits<ll>::max();

void solve() {
    string s;
    cin >> s;
    int l = s.length();
    int zero = 0;
    int one = 0;
    int no = 0;
    if(s == "00") {
        cout << "0 0 ";
        return ;
    }
    string test = "";
    auto con = [&](string ss) -> string {
        if(ss == "0") {
            return "0";
        }
        string ans = "";
        string res = "";
        bool ok = true;
        for(auto i : ss) {
            if(i != '0' && ok) {
                ans += i;
                ok = false;
            } else {
                res += i;
            }
        }
        return ans + res;
    };
    auto check = [&]() -> void {
        if(l >= 38) {
            if(zero == 36 && one == 2) {
                cout << "1000000000000000000 1000000000000000000";
                exit(0);
            } else {
                cout << "-1 -1";
                exit(0);
            }
        }
        if(no == 0) {
            cout << "-1 -1";
            exit(0);
        }
        if(zero > 19 && no < 2) {
            cout << "-1 -1";
            exit(0);
        }
        if(zero >= 18 && one >= 1) {
            int temz = 0;
            int temo = 0;
            string maxx = "";
            string ans = "";
            for(auto i : s) {
                if(temz < 18 && i == '0') {
                    temz++;
                } else if(temo < 1 && i == '1') {
                    temo++;
                } else {
                    ans += i;
                }
            }
            sort(ans.begin(), ans.end());
            if(ans.length() >= 2 && ans.back() == '0') {
                cout << "-1 -1";
                exit(0);
            }
            if(ans == "") {
                cout << "0 100000000000000000";
                exit(0);
            }
            cout << con(ans) << " 1000000000000000000";
            exit(0);
        }
        if(no < 2) {
            cout << "-1 -1";
            exit(0);
        }
    };
    for(auto i : s) {
        if(i == '0') {
            zero++;
        } else if(i == '1') {
            one++;
        }
        if(i != '0') {
            no++;
        }
        if(i != '0' && i != '1') {
            test += i;
        }
    }
    check();
    
    int pre = l - 18;
    sort(s.begin(), s.end());
    // cout << s << '\n';
    
    if(pre >= 1) {
        string p = "";
        string t = "";
        for(auto i : s) {
            if(p.length() < pre) {
                p += i;
            } else {
                t += i;
            }
        }
        s = t;
        // cout << "p : ";
        // cout << p << '\n';
        // cout << "s : "; 
        // cout << s << '\n';
        if(p[pre - 1] == '0' && pre > 1) {
            p.pop_back();
            string tem = "0";
            bool ok = true;
            for(auto i : s) {
                if(i != '0' && ok) {
                    p += i;
                    ok = false;
                } else {
                    tem += i;
                }
            }
            s = tem;
        }
        // cout << "p : ";
        // cout << p << '\n';
        // cout << "s : "; 
        // cout << s << '\n';
        cout << con(p) << ' ';
        cout << con(s);
    } else {
        string ans = "";
        ans += s[0];
        s.erase(s.begin());
        cout << ans << ' ';
        cout << con(s);
    }

}
	 
	
	

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int cn = 1;
	// cin >> cn;
	
	while(cn--)
		solve();
	
	return 0;
}