/*
* Solution to Project Euler problem 97
* By Nayuki Minase
*
* http://nayuki.eigenstate.org/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
import java.math.BigInteger;
public final class p097 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p097().run());
}
public String run() {
BigInteger modulus = BigInteger.TEN.pow(10);
BigInteger n = BigInteger.valueOf(2).modPow(BigInteger.valueOf(7830457), modulus);
n = n.multiply(BigInteger.valueOf(28433)).mod(modulus);
n = n.add(BigInteger.ONE).mod(modulus);
return String.format("%010d", n);
}
}