#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int BigMod(int a, int b) {
  if (b == 0) return 1;
  int x = BigMod(a, b >> 1);
  x = (1LL * x * x) % mod;
  if (b & 1) x = (1LL * x * a) % mod;
  return x;
}
int arr[] = {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};
int main() {
  int n;
  cin >> n;
  n -= 1;
  arr[n] -= 1;
  int ans = BigMod(2, arr[n]) - 1;
  cout << ans << "\n";
  return 0;
}
