#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>
#include <stdlib.h>

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;
string str;

int test() {
  char command[256];
  memset(command, 0, sizeof(command));
//  snprintf(command, sizeof(command), "curl -silent %s > unko.txt", "http://www.geocities.jp/unko_der/sample_01.txt");
  snprintf(command, sizeof(command), "ls");
  bool result = false;
  int return_code = -1;

  return_code = system(command);
  return_code = WEXITSTATUS(return_code);

  if (return_code == 0) {
     // shell実行成功
     result = true;
  } else {
     // shell実行失敗
     result = false;
  }
  return result;
}

int main() {

  assert(test());
  ifstream ifs("unko.txt");
  string s;
  while(ifs >> s) {
    if(s.size() > 114514) {
      raw = s;
      break;
    }
  }
  raw[0] = '3';
//  for(int i=0; i<20; i++) cout << raw[i];cout << endl;
  getline(cin, str);
  for(int i=0; ; i++) {
    if(str[i] != raw[i]) {
      cout << str[i] << " " << raw[i] << endl;
      break;
    }
  }

  return 0;
}