#############################
#############
cnb_max=10**5
mod=998244353
#############

kai=[1]*(cnb_max+1)
rkai=[1]*(cnb_max+1)
for i in range(cnb_max):
    kai[i+1]=kai[i]*(i+1)%mod

rkai[cnb_max]=pow(kai[cnb_max],mod-2,mod)
for i in range(cnb_max):
    rkai[cnb_max-1-i]=rkai[cnb_max-i]*(cnb_max-i)%mod

def cnb(x,y):
    if y>x:
        return 0
    if x<0:return 0
    if y<0:return 0
    return (kai[x]*rkai[y]%mod)*rkai[x-y]%mod


def inv(n):
    return kai[n-1]*rkai[n]%mod

##################################



def sol1(n):
    #O(N^3)
    dp=[[0]*(n+1) for i in range(n+1)]
    dp[0][0]=1
    for i in range(1,n+1):
            for j in range(n+1):
                for cnti in range(1,n+1):
                    if j-cnti<0:continue
                    dp[i][j]+=dp[i-1][j-cnti]*cnb(n-(j-cnti),cnti)
                    dp[i][j]%=mod
    def f(k):
        if k==0:return 1
        ans=0
        for s in range(1,n+1):
            ans+=dp[k][s]*pow((pow(2,k,mod)-k)%mod,n-s,mod)
            ans%=mod
        return ans
    ans=0
    for k in range(n+1):
        ans+=f(k)*rkai[k]
        ans%=mod
    return ans


def sol2(n):
    #O(N^2)
    def _(i, j):
        if min(i, j) < 0: return -1
        return i * (n+2) + j

    num = [0] * (n+2) ** 2
    st = [0] * (n+2) ** 2
    for k in range(1, n+1):
        nod = pow(2, k, mod) - k
        nod %= mod
        num[_(k, 0)] = 1
        for i in range(1, n+1):
            num[_(k, i)] = num[_(k, i - 1)] * nod % mod
    st[_(0, 0)] = 1
    for i in range(1, n+1):
        for j in range(1, i + 1):
            st[_(i, j)] = st[_(i - 1, j - 1)] + st[_(i - 1, j)] * j
            st[_(i, j)] %= mod

    ans=1
    for k in range(1,n+1):
        for m in range(k,n+1):
            res=cnb(n,m)*st[_(m,k)]%mod
            res*=num[_(k,n-m)]
            ans+=res
            ans%=mod
    return ans%mod

s=[]
fs={0}
def naive(n):
    u=[i for i in range(1,2**n)]
    ans=[0]
    def dfs(i):
        global fs
        if i==len(u):
            ans[0]+=1
            return
        dfs(i+1)
        if True:
            bffs={x for x in fs}
            for x in bffs:
                fs.add(x|u[i])
            s.append(u[i])
            if len(fs)==2**(len(s)):dfs(i+1)
            s.pop()
            fs={x for x in bffs}
        return
    dfs(0)
    return ans[0]


n=int(input())
print(sol2(n))