#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

string S;
int M[10], A[10] = {20104, 20063, 19892, 20011, 19874, 20199, 19898, 20163, 19956, 19841};

void solve() {
    cin>>S;
    
    REP(i,S.size()) {
        if (S[i]=='.') continue;
        M[S[i]-'0']++;
    }
    
    int from = 0, to = 0;
    REP(i,10) {
        if (M[i] < A[i]) from = i;
        if (M[i] > A[i]) to = i;
    }
    
    cout << from << " " << to << endl;
}