#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<deque>
#include<cctype>
#include<string.h>
#include<math.h>
#include<time.h>
#include<random>
#include<functional>
#include<stack>
#include<unordered_map>
#include<string>
#define ll                                  long long 
#define lowbit(x) (x & -x)
//#define endl "\n"//                           交互题记得删除
using namespace std;
mt19937 rnd(time(0));
const ll mod = 998244353;
//const ll p=rnd()%mod;
#define F first
#define S second
ll ksm(ll x, ll y)
{
    ll ans = 1;
    while (y)
    {
        if (y & 1)
        {
            ans = ans % mod * (x % mod) % mod;
        }
        x = x % mod * (x % mod) % mod;
        y >>= 1;
    }
    return ans % mod % mod;
}
ll gcd(ll x, ll y)
{
    if (y == 0)
        return x;
    else
        return gcd(y, x % y);
}
void fio()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
struct s
{
    ll l, r;
    friend bool operator<(const s& a, const s& b)
    {
        return a.l > b.l;
    }
};
int main()
{
    fio();
    ll t;
    t=1;
    while (t--)
    {
        ll n;
        cin>>n;
        if(n<=2)
        cout<<n%mod<<endl;
        else 
        cout<<(n%mod*2)%mod<<endl;
    }
}