#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

typedef unsigned long long ull;
const unsigned B = 123456789;
const int N = 200002;

ull calcPiHash() {
	FILE *f = fopen("C:/test/sagyo/pi1000000.txt", "r");
	char *buf = new char[N + 10];
	fread(buf, 1, N, f);
	buf[N] = 0;
	fclose(f);
	ull h = 0;
	rep(i, N)
		h = h * B + buf[i];
	return h;
}

int main() {
	const ull PiHash = 11344757668233097127;
	char *S = new char[N + 1];
	scanf("%s", S);
	assert(strlen(S) == N);
	ull h = 0;
	rep(i, N)
		h = h * B + S[i];
	ull p = 1;
	for(int i = N - 1; i >= 0; -- i) {
		rep(d, 10) {
			ull nh = h - S[i] * p + ('0' + d) * p;
			if(nh == PiHash) {
				printf("%d %d\n", S[i] - '0', d);
				return 0;
			}
		}
		p *= B;
	}
	abort();
	return 0;
}