#include <bits/stdc++.h>
using namespace std;

using Int = long long;
const char newl = '\n';

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
template<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}
template<typename T=Int>
vector<T> read(size_t n){
  vector<T> ts(n);
  for(size_t i=0;i<n;i++) cin>>ts[i];
  return ts;
}


template<typename T, T MOD = 1000000007>
struct Mint{
  inline static constexpr T mod = MOD;
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }

  static Mint add_identity(){return Mint(0);}
  static Mint mul_identity(){return Mint(1);}

  Mint inv(){return pow(MOD-2);}

  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}

  Mint operator+(Mint a) const{return Mint(v)+=a;}
  Mint operator-(Mint a) const{return Mint(v)-=a;}
  Mint operator*(Mint a) const{return Mint(v)*=a;}
  Mint operator/(Mint a) const{return Mint(v)/=a;}

  Mint operator+() const{return *this;}
  Mint operator-() const{return v?Mint(MOD-v):Mint(v);}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}

  static Mint comb(long long n,Int k){
    Mint num(1),dom(1);
    for(Int i=0;i<k;i++){
      num*=Mint(n-i);
      dom*=Mint(i+1);
    }
    return num/dom;
  }
};
template<typename T, T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}

const Int MAX = 2e5+10;
Int pr[MAX]={};
Int sq[MAX]={};
Int sign[MAX]={};


template <class T, typename F>
void divisor_transform(std::vector<T> &a, F f) {
  int n = a.size();
  std::vector<bool> sieve(n, true);
  for (int p = 2; p < n; ++p) {
    if (sieve[p]) {
      for (int k = 1; k * p < n; ++k) {
        sieve[k * p] = false;
        f(a[k], a[k * p]);
      }
    }
  }
}

template <class T, typename F>
void inverse_divisor_transform(std::vector<T> &a, F f) {
  int n = a.size();
  std::vector<bool> sieve(n, true);
  for (int p = 2; p < n; ++p) {
    if (sieve[p]) {
			for (int k = (n - 1) / p; k != 0; --k) {
        sieve[k * p] = false;
        f(a[k], a[k * p]);
      }
    }
  }
}

//INSERT ABOVE HERE
signed main(){
  cin.tie(0);
  ios::sync_with_stdio(0);

  for(Int i=2;i<MAX;i++){
    if(pr[i]) continue;
    for(Int j=i;j<MAX;j+=i) pr[j]=i;
    for(Int j=i*i;j<MAX;j+=i*i) sq[j]=1;
  }

  Int n;
  cin>>n;

  sign[1]=1;
  for(Int i=2;i<=n;i++){
    if(sq[i]) continue;
    sign[i]=-sign[i/pr[i]];
  }

  using M = Mint<Int, 998244353>;
  vector<M> way(MAX,0),emp(MAX,0);
  M all{0};
  M cnt{0};

  for(Int i=1;i<=n;i++){
    //cout<<i<<':'<<sign[i]<<endl;
    way[i]=M(sign[i])*M(2).pow(n/i);
    emp[i]=M(sign[i])*M(1).pow(n/i);
    all+=way[i];
    cnt+=emp[i];
  }

  auto zeta=[&](M &lo,M &hi){hi+=lo;};
  auto moebius=[&](M &lo,M &hi){hi-=lo;};
  divisor_transform(way,zeta);
  divisor_transform(emp,zeta);

  vector<M> dp0(MAX,0),dp1(MAX,0),dp2(MAX,0);
  for(Int i=1;i<MAX;i++){
    dp0[i]=emp[i]*emp[i];
    dp1[i]=emp[i]*way[i];
    dp2[i]=way[i]*way[i];
  }
  inverse_divisor_transform(dp0,moebius);
  inverse_divisor_transform(dp1,moebius);
  inverse_divisor_transform(dp2,moebius);

  M ans=(all-cnt)*(all-cnt);
  M sum{0};

  M cof=M(3)/M(4);
  for(Int i=1;i<MAX;i++){

    M res{0};
    res+=dp2[i]*cof.pow(n/i);
    res-=M(2)*dp1[i];
    res+=dp0[i];
    sum+=res;

    ans-=dp2[i];
    ans+=M(2)*dp1[i];
    ans-=dp0[i];
  }
  cout<<ans+sum<<newl;
  return 0;
}