// Problem: B - Small business
// Contest: Virtual Judge - Namomo Summer Camp 23 Day 3
// URL: https://vjudge.net/contest/577185#problem/B
// Memory Limit: 254 MB
// Time Limit: 1000 ms

#include <bits/stdc++.h>
using namespace std;

// 2023 OneWan

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	string str;
	cin >> str;
	if (str.size() > 40) {
		cout << -1 << " " << -1 << "\n";
	} else {
		vector<int> a(27);
		for (int i = 0 ; i < str.size() ; i++) {
			a[str[i] ^ 48]++;
		}
		int len = str.size();
		pair<long long, long long> ans = {2000000000000000000LL, 2000000000000000000LL};
		if (a[0] >= 18 && a[1] >= 1) {
			auto b = a;
			b[0] -= 18;
			b[1]--;
			int L = len - 19;
			__int128 x = 0, y = 1000000000000000000LL;
			if (L == 1) {
				bool flag = true;
				for (int i = 0 ; i < 10 ; i++) {
					if (b[i]) {
						b[i]--;
						x = i;
						flag = false;
						break;
					}
				}
				if (flag) {
					x = 2000000000000000000LL;
				}
			} else {
				bool flag = true;
				for (int i = 1 ; i < 10 ; i++) {
					if (b[i]) {
						b[i]--;
						x = i;
						flag = false;
						break;
					}
				}
				if (flag) {
					x = 2000000000000000000LL;
				} else {
					for (int cnt = 1 ; cnt < L ; cnt++) {
						for (int i = 0 ; i < 10 ; i++) {
							if (b[i]) {
								b[i]--;
								x = x * 10 + i;
								break;
							}
						}
					}
				}
			}
			if (x <= 1000000000000000000LL && y <= 1000000000000000000LL) {
				if (x > y) swap(x, y);
				ans = min(ans, make_pair((long long) x, (long long) y));
			}
		}
		for (int L = 1 ; L < len ; L++) {
			auto b = a;
			int R = len - L;
			__int128 x = 0, y = 0;
			if (L == 1) {
				bool flag = true;
				for (int i = 0 ; i < 10 ; i++) {
					if (b[i]) {
						b[i]--;
						x = i;
						flag = false;
						break;
					}
				}
				if (flag) {
					x = 2000000000000000000LL;
				}
			} else {
				bool flag = true;
				for (int i = 1 ; i < 10 ; i++) {
					if (b[i]) {
						b[i]--;
						x = i;
						flag = false;
						break;
					}
				}
				if (flag) {
					x = 2000000000000000000LL;
				} else {
					for (int cnt = 1 ; cnt < L ; cnt++) {
						for (int i = 0 ; i < 10 ; i++) {
							if (b[i]) {
								b[i]--;
								x = x * 10 + i;
								break;
							}
						}
					}
				}
			}
			if (R == 1) {
				bool flag = true;
				for (int i = 0 ; i < 10 ; i++) {
					if (b[i]) {
						b[i]--;
						y = i;
						flag = false;
						break;
					}
				}
				if (flag) {
					y = 2000000000000000000LL;
				}
			} else {
				bool flag = true;
				for (int i = 1 ; i < 10 ; i++) {
					if (b[i]) {
						b[i]--;
						y = i;
						flag = false;
						break;
					}
				}
				if (flag) {
					y = 2000000000000000000LL;
				} else {
					for (int cnt = 1 ; cnt < R ; cnt++) {
						for (int i = 0 ; i < 10 ; i++) {
							if (b[i]) {
								b[i]--;
								y = y * 10 + i;
								break;
							}
						}
					}
				}
			}
			if (x <= 1000000000000000000LL && y <= 1000000000000000000LL) {
				if (x > y) swap(x, y);
				ans = min(ans, make_pair((long long) x, (long long) y));
			}
		}
		if (ans.second <= 1000000000000000000LL) {
			cout << ans.first << " " << ans.second << "\n";
		} else {
			cout << -1 << " " << -1 << "\n";
		}
	}
	return 0;
}