3 region 2014-2015 2 day

#include "bits/stdc++.h"

//speed coding

#define mp make_pair
#define cve(a) for (auto i : a) {cout << i << " ";  } cout << "\n";
#define f first
#define s second
#define loop(x, n) for (int i = x; i < n; i++)
#define joop(x, n) for (ll j = x; j < n; j++)
#define err cout << "ERROR" << endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define sz(x) x.size()

// types
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vector<int>>
#define vvll vector<vector<ll>>
typedef long long ll;

// types of data
#define inf 1000000000
#define infll 1000000000000000000
#define mod 1000000007

//#define DEBUG 1

using namespace std;

void solve(){
    ll n, zxc;
    cin >> n >> zxc;

    vector<map<pll, ll>> dp(n+1);
    map<pll, vector<pll>> m;
    m[{0, 0}] = {{0, 0}, {0, 0}, {1, 0}, {0, 1}, {1, 1}};
    m[{0, 1}] = {{0, 0}, {1, 0}};
    m[{1, 0}] = {{0, 0}, {0, 1}};
    m[{1, 1}] = {{0, 0}};
    m[{-1, 0}] = {{0, 0}, {0, 0}, {0, 1}};
    m[{-1, 0}] = {{0, 0}, {0, 0}, {1, 0}};

    dp[0][{0, 0}] = 2;
    dp[0][{1, 0}] = 1;
    dp[0][{0, 1}] = 1;
    dp[0][{1, 1}] = 1;
    ll d = 0;


    while(d < n){
        for(auto [k, v] : m){
            for(auto t : m[k]){
                dp[d+1][t] += dp[d][k];
                dp[d+1][t] %= mod;
            }
        }
        d++;
    }

    cout << dp[n-1][{0, 0}];


}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
#ifdef DEBUG
    freopen("text.txt", "r", stdin);
#else
#endif
    solve();
    return 0;
}