#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int umekomi[10] = {20104,20063,19892,20011,19874,20199,19898,20163,19956,19841};

int main() {
	string s;
	cin >> s;
	
	int cnt[10] = {};
	cnt[s[0] - '0']++;
	FOR(i, 2, s.size()) cnt[s[i] - '0']++;
	
	int be, af;
	REP(i, 10) {
		if (umekomi[i] < cnt[i]) be = i;
		if (umekomi[i] > cnt[i]) af = i;
	}
	
	printf("%d %d\n", be, af);
	
	return 0;
}