#include <bits/stdc++.h>
#include <math.h>

#include <algorithm>
#include <array>
#include <atcoder/all>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <vector>

using namespace std;
using namespace atcoder;

using Graph = vector<vector<int>>;

using ll = long long;
typedef pair<ll, ll> P_ll;
typedef pair<int, int> P;

const ll INF_ll = 1e17;
const int INF = 1e8;
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  string S;
  cin >> S;
  vector<ll> cnt(10, 0);
  for (auto c : S) {
    if (c == '.') {
      continue;
    }
    cnt[c - '0']++;
  }
  vector<int> ref = {20104, 20063, 19892, 20011, 19874,
                     20199, 19898, 20163, 19956, 19841};
  P_ll ans;
  for (int i = 0; i < 10; i++) {
    if (cnt[i] == ref[i] + 1) {
      ans.first = i;
    }
    if (cnt[i] == ref[i] - 1) {
      ans.second = i;
    }
  }
  cout << ans.first << " " << ans.second << endl;

  return 0;
}