#include "inv.h"
#include <unordered_map>
using namespace std;

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

typedef long long ll;

unordered_map<int, int> mp;

ll Inv[N];

ll ask(ll x)
{
    if(mp.find(x) != mp.end()) return mp[x];
    return mp[x] = (mod - mod / x) * ask(mod % x) % mod;
}

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

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