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

#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define repr(i,n) for(int i=(int)(n-1);i>=0;i--)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout << #x" = " << x << endl
#define print(x) cout << x << endl
#define maxch(x,y) x=max(x,y)
#define minch(x,y) x=min(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt(x) bitset<32>(x).count()

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;
typedef pair<int, P> PIP;
typedef pair<ll, ll> PL;
typedef pair<P, ll> PPL;
typedef set<int> S;

#define INF INT_MAX/3
#define MAX_N 1000000001

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

int main(){
    cin.sync_with_stdio(false);
    string s;
    cin >> s;

    int cnt[10] = {};
    rep(i, s.size()){
        if (s[i] == '.') continue;
        cnt[s[i] - '0']++;
    }

    int a, b;
    rep(i, 10) {
        if (num[i] > cnt[i]) b = i;
        if (num[i] < cnt[i]) a = i;
    }

    cout << a << " " << b << endl;

    return 0;
}