

DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 452 Accepted Submission(s): 281 Problem Description Given a normal dice (with 1, 2, 3, 4, 5, 6 on each face), we define: F(N) to be the expected number of tosses until we have a number facing up for N consecutive times. H(N) to be the expected number of tosses until we have the number '1' facing up for N consecutive times. G(M) to be the expected number of tosses until we have the number '1' facing up for M times. Given N, you are supposed to calculate the minimal M1 that G (M1) >= F (N) and the minimal M2 that G(M2)>=H(N) Input The input contains multiple cases. Each case has a positive integer N in a separated line. (1<=N<=1000000000) The input is terminated by a line containing a single 0. Output For each case, output the minimal M1 and M2 as required in a single line, separated by a single space. Since the answer could be very large, you should output the answer mod 2011 instead. Sample Input
Sample Output
Source  
