#include <bits/stdc++.h>
using namespace std;
const int maxn = 60;
const int mod = 1e9 + 7;
long long int mersenne[maxn] = {
    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};
long long int p(long long int a, long long int b) {
  if (b == 0) return 1;
  long long int t = p(a, b / 2);
  t = (t * t) % mod;
  return (b % 2 ? (t * a) % mod : t);
}
int main() {
  int n;
  cin >> n;
  cout << (p(2, mersenne[n - 1] - 1) - 1 + mod) % mod << endl;
  return 0;
}
