#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

void cnt(){
    string s;cin>>s;

    vector<int> cnt(10,0);
    for(auto &c:s)cnt[c-'0']++;
    rep(i,10) cout<<i<<" : "<<cnt[i]<<endl;
}

signed main(){

    // cnt();

    vector<int> correct{20104,20063,19892,20011,19874,20199,19898,20163,19956,19841};

    string s;cin>>s;
    vector<int> v(10,0);
    for(auto &c:s){
        if(c=='.') continue;
        v[c-'0']++;
    }

    int fs,sc;
    rep(i,10){
        if(correct[i]>v[i]) sc=i;
        else if(correct[i]<v[i]) fs=i;
    }
    cout<<fs<<" "<<sc<<endl;
    return 0;
}