

Input

The input contains a single integer a (1 ≤ a ≤ 30).

Output

Output a single integer.

Example

Input

3


Output

27
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int MAXN = 2e6 + 100;
template <typename T1, typename T2>
inline void chkmin(T1 &x, T2 y) {
  if (y < x) x = y;
};
template <typename T1, typename T2>
inline void chkmax(T1 &x, T2 y) {
  if (y > x) x = y;
};
int gcd(int x, int y) { return (y == 0 ? x : gcd(y, x % y)); }
inline int mul(int a, int b) { return (1ll * a * b) % mod; }
inline int sub(int a, int b) {
  a -= b;
  if (a < 0) a += mod;
  if (a >= mod) a -= mod;
  return a;
}
inline int add(int a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  if (a < 0) a += mod;
  return a;
}
inline int expo(int a, int b) {
  int values = 1;
  while (b) {
    if (b & 1) values = mul(values, a);
    a = mul(a, a);
    b >>= 1;
  }
  return values % mod;
}
int a[] = {4,   22,  27,  58,  85,  94,  121, 166, 202, 265, 274,  319,  346,
           355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562,  576,  588,
           627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728,  729,  762,
           778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086, 1111, 1165};
void solve() {
  int n;
  cin >> n;
  cout << a[n - 1];
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
