#include "inv.h"

const int M = 133834517;
const int mod = 998244353;

typedef long long ll;

struct HashMap
{
	int ct, a[M], v[M], nxt[M], head[M];
	inline int &operator[](const int &tmp)
	{
		int x = 19260817ll * tmp % M;
		for(int i = head[x];i;i = nxt[i])
			if(a[i] == tmp) return v[i];
		nxt[++ct] = head[x], head[x] = ct;
		a[ct] = tmp; return v[ct];
	}
	inline bool find(int tmp)
	{
		int x = 19260817ll * tmp % M;
		for(int i = head[x];i;i = nxt[i])
			if(a[i] == tmp) return 1;
		return 0;
	}
} mp;

ll ask(ll x)
{
    if(mp.find(x)) 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);
}