#include #include #include #include #include #include #define fir first #define sec second #define get(n) scanf("%d",&n); #define gets(s) string s;cin >> (s); #define All(s) (c).begin(), (c).end() #define chmin(x, y) x = min(x, y); #define chmax(x, y) x = max(x, y); #define rep(i, j) for (int (i)=0;(i)<(j);(i)++) #define repk(i, j, k) for(int (i)=(j);(i)<(k);(i)++) #define dump(x) cout << #x << " = " << (x) << endl; #define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; using namespace std; typedef long long int ll; const ll INF = 10241024; const int MA = 2*(1e6); string S; int correct[10] = {20104,20063,19892,20011,19874,20199,19898,20163,19956,19841}; void input(){ cin >> S; } void solve(){ int times[10];rep(i,10) times[i] = 0; for(auto c : S){ if(c != '.'){ times[c] += 1; } } int a , b; rep(i,10){ if(correct[i] == times[i] - 1) a = i; if(correct[i] == times[i] + 1) b = i; cout << a << " " << b << endl; } return; } int main () { solve(); return 0; }