def solve():
return nth(partitionNums(), 100) - 1
def solve():
n = 10001
sieve(ceil(n*log(n) + n*log(log(n))))
return nth(primeIter(), n-1)
def solve():
return sum(int(c) for c in str(nth(convergents(eCF()), 99)[0]))
