#include "inv.h"

const int N = 10000010;
const int mod = 998244353;

typedef long long ll;

ll Inv[N];

ll ask(ll x)
{
    if(x <= 10000000) return Inv[x];
    return (mod - mod / x) * ask(mod % x) % mod;
}

void init(int p)
{
	Inv[1] = 1;
	for(int i = 2;i <= 10000000;i++)
		Inv[i] = (mod - mod / i) * Inv[mod % i] % mod;
}

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