#include<bits/stdc++.h> using namespace std; const int MOD = 1000000007; int main() { int n; cin >> n; if (n % 2 != 0) { cout << 0 << endl; return 0; } if (n == 0) { cout << 1 << endl; return 0; } if (n == 2) { cout << 3 << endl; return 0; } vector<long long> dp(n / 2 + 1, 0); dp[0] = 1; dp[1] = 3; for (int i = 2; i <= n / 2; i++) { dp[i] = (4 * dp[i - 1] - dp[i - 2] + MOD) % MOD; } cout << dp[n / 2] % MOD << endl; return 0; }