#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const int MOD = 1000000007;

int main()
{
    int n;
    cin >> n;

    vector<vector<long long> > dp(1, vector<long long>(1, 1));
    for(int i=0; i<n; ++i){
        vector<vector<long long> > nextDp(i+2, vector<long long>(2*i+3));
        for(int a=0; a<i+1; ++a){
            for(int b=0; b<2*i+1; ++b){
                nextDp[a][b] += dp[a][b] * ((a + b) * (a + b - 1) + a);
                nextDp[a][b+1] += dp[a][b] * (a + b) * 2;
                nextDp[a][b+2] += dp[a][b];
                nextDp[a+1][b] += dp[a][b];
                if(b > 0)
                    nextDp[a+1][b-1] += dp[a][b] * b;
            }
        }
        dp.swap(nextDp);
        for(int a=0; a<i+2; ++a){
            for(int b=0; b<2*i+3; ++b){
                dp[a][b] %= MOD;
            }
        }
    }

    long long ret = 0;
    for(int a=0; a<n+1; ++a){
        ret += dp[a][0];
        ret %= MOD;
    }
    cout << ret << endl;

    return 0;
}