#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

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

int main() {
    string s;
    cin >> s;
    int n = s.size();
    int cnt[10] = {};
    rep(i,n){
        if(s[i] == '.')continue;
        cnt[s[i]-'0']++;
    }
    int a = -1, b = -1;
    rep(i,10){
        if(f[i] < cnt[i]) a = i;
        if(f[i] > cnt[i]) b = i;
    }
    cout << a << ' ' << b << endl;
    return 0;
}