CF225E.Unsolvable

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Consider the following equation:

where sign [a][a] represents the integer part of number aa .Let's find all integer zz (z>0) , for which this equation is unsolvable in positive integers. The phrase "unsolvable in positive integers" means that there are no such positive integers xx and yy (x,y>0) , for which the given above equation holds.

Let's write out all such zz in the increasing order: z1,z2,z3z_{1},z_{2},z_{3} , and so on (z_{i}<z_{i+1}) . Your task is: given the number nn , find the number znz_{n} .

输入格式

The first line contains a single integer nn ( 1<=n<=401<=n<=40 ).

输出格式

Print a single integer — the number znz_{n} modulo 10000000071000000007 (109+7)(10^{9}+7) . It is guaranteed that the answer exists.

输入输出样例

  • 输入#1

    1
    

    输出#1

    1
  • 输入#2

    2
    

    输出#2

    3
  • 输入#3

    3
    

    输出#3

    15
首页