#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include <valarray>
#include <cmath>
#include <numeric>
#include <random>

using namespace std;

#define ll long long
//#define int ll

const int maxN = 3e2+10, mod = 998244353;
int n, p[maxN], cnt[maxN][maxN];
ll dp[maxN];

ll power(ll x, ll y){
    ll an = 1;
    while(y){
        if (y&1) an = an*x % mod;
        y >>= 1;
        x = x*x %mod;
    }
    return an;
}

ll inv(ll x){
    return power(x, mod-2);
}

ll count(int x, int y, int x_, int y_){
    return cnt[x_][y_]-cnt[x_][y-1]-cnt[x-1][y_]+cnt[x-1][y-1];
}

void solve(){
    while (true);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie();
    int t = 1;
    while (t--) solve();
    return 0;
}