#include <iostream>
#include <cstring>
using namespace std;
const int MOD=998244353;
int n;
int vis[30][30];        
int pian;
long long tot=0;
const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,1,-1};
void dfs(int x,int y,int steps,int dist) {
    if(steps==n){
        tot=(tot+dist)%MOD;
        return;
    }
    for(int d=0;d<4;d++){
        int nx=x+dx[d];
        int ny=y+dy[d];
        if(!vis[nx][ny]) 
			dist++;;
        vis[nx][ny]++;
        dfs(nx,ny,steps+1,dist);
        vis[nx][ny]--;
        if (!vis[nx][ny]) 
			dist--;
    }
    return;
}
int main(){
	freopen("home.in","r",stdin);
	freopen("home.out","w",stdout);
    cin>>n;
    pian=n;             
    memset(vis,0,sizeof(vis));
    vis[pian][pian]=1;
    dfs(pian,pian,0,1);   
    cout<<tot;
    return 0;
}