The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Unsolvable

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputConsider the following equation:

Let's find all integer *z* (*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 *x* and *y* (*x*, *y* > 0), for which the given above equation holds.

Let's write out all such *z* in the increasing order: *z*_{1}, *z*_{2}, *z*_{3}, and so on (*z*_{i} < *z*_{i + 1}). Your task is: given the number *n*, find the number *z*_{n}.

Input

The first line contains a single integer *n* (1 ≤ *n* ≤ 40).

Output

Print a single integer — the number *z*_{n} modulo 1000000007 (10^{9} + 7). It is guaranteed that the answer exists.

Examples

Input

1

Output

1

Input

2

Output

3

Input

3

Output

15

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/22/2022 01:11:35 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|