#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
const long double pi = 3.14159265358979323846;
const long long mod = 1000000007;
long long binpow(long long a, long long n) {
  if (n <= 0) return 1;
  if (n == 1) return a;
  long long z = binpow(a, n / 2) % mod;
  if (n % 2 == 0) return (z * z) % mod;
  return (((z * z) % mod) * a) % mod;
}
long long ans[] = {2,       3,       5,        7,        13,      17,
                   19,      31,      61,       89,       107,     127,
                   521,     607,     1279,     2203,     2281,    3217,
                   4253,    4423,    9689,     9941,     11213,   19937,
                   21701,   23209,   44497,    86243,    110503,  132049,
                   216091,  756839,  859433,   1257787,  1398269, 2976221,
                   3021377, 6972593, 13466917, 20996011, 24036583};
int main() {
  ios::sync_with_stdio(false);
  long long n, anss;
  cin >> n;
  anss = binpow(2, ans[n - 1] - 1);
  cout << (anss - 1) % mod;
  return 0;
}
