#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using namespace std;
typedef long long ll;

int main() {
	string s;
	cin >> s;
	ll correct_hash = 914951198;
	ll hash = 0;
	ll mod = 1e9 + 7;
	ll base = 1004;
	rep (i, s.length()) {
		hash = (hash * base + s[i]) % mod;
	}
	ll pow_base = 1;
	repr (i, s.length()) {
		if (i != 1) {
			hash -= pow_base * s[i];
			rep (j, 10) {
				hash += pow_base * (j + '0');
				hash %= mod; hash += mod; hash %= mod;
				if (hash == correct_hash) {
					cout << s[i] << " " << j << endl;
					return 0;
				}
				hash -= pow_base * (j + '0');
			}
			hash += pow_base * s[i];
		}
		(pow_base *= base) %= mod;
	}
	return 0;
}