#include <bits/stdc++.h>
using namespace std;
const int p = 1000000007;
int a[41] = {0,       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};
long long mul(int x, int y) {
  if (y == 1) return x;
  long long temp = mul(x, y / 2);
  temp = (temp * temp) % p;
  if (y % 2 > 0) temp = (temp * x) % p;
  return temp;
}
int main(void) {
  int n;
  scanf("%d", &n);
  printf("%I64d\n", (mul(2, a[n] - 1) - 1 + p) % p);
}
