from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
# input = sys.stdin.readline

T = 165858069
class Rolling_hash():
    def __init__(self,S,mod_list = [1000000009,998244353,3000012541],base_num_list=[500009,500029,500041]):
        
        self.n = len(mod_list)
        self.S = S
        self.N = len(self.S)
        self.H = [[0]*(self.N+1) for _ in range(self.n)]
        self.b_inv = [[1]*self.N for _ in range(self.n)]
        self.mod_list = mod_list
        
        for j in range(self.n):
            
            tb = base_num_list[j]
            base_num = base_num_list[j]
            mod = mod_list[j]
            tb_inv = 1
            base_inv = pow(base_num,mod-2,mod)
            tH = self.S[0]
            self.H[j][1] = tH
            
            for i in range(self.N-1):
                tH = (tH + self.S[i+1]*tb)%mod
                self.H[j][i+2] = tH
                
                tb = (tb*base_num)%mod
                
                tb_inv *= base_inv
                tb_inv %= mod
                self.b_inv[j][i+1] = tb_inv
                
    def query(self,j,l,r):
        if l>=r:
            return 0
        if l>=self.N:
            return 0
        tmp = (self.H[j][r]-self.H[j][l])*self.b_inv[j][l]%self.mod_list[j]
        
        return tmp
        
X = input()
X = X.replace('.','')
X = list(X)
X = [int(i) for i in X]

rh = Rolling_hash(X)
M = 200001
mod = 10**9 + 9
b = 500009
for i in range(M):
    L = rh.query(0,0,i)
    R = (rh.query(0,i+1,M)*pow(b,i+1,mod))%mod
    for j in range(10):
        val = (L + j*pow(b,i,mod) + R)%mod
        if val==T:
            print(X[i],j)
            exit()