#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
const ll MOD=1e9+7;
#include<cassert>
int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  string str;
  vector<int> cnt(256),ans={20104,20063,19892,20011,19874
			    ,20199,19898,20163,19956,19841};
  cin>>str;
  char a=0,b=0;
  for(char c:str) ++cnt[c];
  for(char c='0';c<='9';++c){
    if(cnt[c]<ans[c-'0']){
      assert(a==0);
      a=c;
    }else if(cnt[c]>ans[c-'0']){
      assert(b==0);
      b=c;
    }
  }
  assert(a&&b);
  cout<<a<<" "<<b<<endl;
  return 0;
}