#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>
#include <fstream>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

typedef long long ll;
int const inf = 1<<29;

string raw;

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

int main() {

  cin >> raw;
  int n = raw.size();
  rep(i, n) {
    num[raw[i]-'0']--;
  }

  int fal, tru;
  rep(i, 10) {
    if(num[i] > 0) {
      tru = i;
    }
    else if(num[i] < 0) {
      fal = i;
    }
  }

  cout << fal << " " << tru << endl;

  return 0;
}