#pragma region GNUC
//以下を参考にした
//https://yukicoder.me/wiki/auto_vectorization
#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif
#pragma endregion

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
//#include <array>//x C++ (G++ 4.6.4)

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <cassert>//assert();
#include <fstream>
#include <random>
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)

/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#define PII pair<int,int>
/////////
using namespace::std;

// 最大公約数
template<class T>
inline T gcd(T a, T b){return b ? gcd(b, a % b) : a;}
//inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}

// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a / gcd(a, b) * b;}
//inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////
//解説見た
void solve(){
	/*fstream file("sample_01.txt");
	string str;
	getline(file,str);
	vector<int> num(10,0);
	int size = str.size();
	for(int i=0;i<size;++i){
		if(str[i] == '.')continue;
		num[ str[i]-'0' ]++;
	}
	for(int i=0;i<10;++i){
		cout << num[i] << ",";
	}*/
	int num[] = {20104,20063,19892,20011,19874,20199,19898,20163,19956,19841};
	string str;
	cin >> str;
	int size = str.size();
	vector<int> Snum(10,0);
	for(int i=0;i<size;++i){
		if( str[i] == '.')continue;
		Snum[ str[i]-'0']++;
	}

	int small,big;
	for(int i=0;i<10;++i){
		if( num[i] < Snum[i] ){
			small = i;
		}else if(num[i] > Snum[i]){
			big = i;
		}
	}
	cout << small << " " << big << endl;
}

signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	//std::cout << std::fixed;//小数を10進数表示
	//cout << setprecision(16);//小数点以下の桁数を指定
	
	solve();
}