#include"inv.h"
#include<bits/stdc++.h>
using namespace std;
using ll=long long;

constexpr int mod=998244353;

ll inver[1000005];

int xd(int a) {
    if(a<=1e6 and inver[a])return inver[a];
  return a <= 1 ? a : inver[a]=mod - (long long)(mod/a) * xd(mod % a) % mod;
}


void init(int p){
    inver[1]=1;
}

int inv(int x){
    return xd(x);
}