#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#define REP(i,n) for(int i = 0; n > i; i++)

using namespace std;
typedef vector<int> Ivec;
typedef pair<int, int> pii;

int main() {
	array<int, 10> count = { 
		20104
		,20063
		,19892
		,20011
		,19874
		,20199
		,19898
		,20163
		,19956
		,19841
	}, ansho = {};

	

	REP(i, 200002) {
		char c;
		scanf("%c", &c);
		if (c == '.')continue;
		ansho[c - '0']++;
	}
	int bef, af;
	REP(i,10) {
		if (count[i] < ansho[i]) bef = i;
		else if (count[i] > ansho[i]) af = i;
	}
	printf("%d %d\n", bef, af);
	return 0;
}