#include <stdio.h>

long long gcd (long long a, long long b) {
  if (b <= 0LL) {
    return a;
  }
  
  return gcd(b, a%b);
}

int main () {
  long long n = 0LL;
  
  int res = 0;
  
  long long ans = 0LL;
  long long mod_num = 998244353LL;
  
  long long tmp = 0LL;
  long long pl[20] = {};
  long long pc[20] = {};
  int pcnt = 0;
  
  long long div[6720] = {};
  int divcnt = 0;
  
  int *e[6720] = {};
  long long *c[6720] = {};
  int ecnt[6720] = {};
  
  int e_arr[20000000] = {};
  long long c_arr[20000000] = {};
  int sum = 0;
  
  int divpcnt[6720][20] = {};
  
  long long dp[6720] = {};
  
  res = scanf("%lld", &n);
  
  tmp = n;
  for (long long p = 2LL; p*p <= n; p += 1LL) {
    if (tmp%p == 0LL) {
      pl[pcnt] = p;
      while (tmp%p == 0LL) {
        tmp /= p;
        pc[pcnt]++;
      }
      pcnt++;
    }
    if (n%p == 0LL) {
      div[divcnt] = p;
      divcnt++;
    }
  }
  
  if (tmp > 1LL) {
    pl[pcnt] = tmp;
    pc[pcnt] = 1;
    pcnt++;
  }
  
  if (divcnt <= 0) {
    printf("1\n");
    return 0;
  }
  
  if (div[divcnt-1]*div[divcnt-1] == n) {
    for (int i = 0; i < divcnt-1; i++) {
      div[2*divcnt-2-i] = n/div[i];
    }
    divcnt = 2*divcnt-1;
  } else {
    for (int i = 0; i < divcnt; i++) {
      div[2*divcnt-1-i] = n/div[i];
    }
    divcnt *= 2;
  }
  
  div[divcnt] = n;
  divcnt++;
  
  for (int i = 0; i < divcnt; i++) {
    for (int j = 0; j < pcnt; j++) {
      long long tmp = div[i];
      while (tmp%pl[j] == 0LL) {
        tmp /= pl[j];
        divpcnt[i][j]++;
      }
    }
  }
  
  for (int i = 0; i < divcnt; i++) {
    e[i] = e_arr+sum;
    c[i] = c_arr+sum;
    for (int j = i+1; j < divcnt; j++) {
      if (div[j]%div[i] == 0LL) {
        e[i][ecnt[i]] = j;
        c[i][ecnt[i]] = 1LL;
        for (int k = 0; k < pcnt; k++) {
          if (divpcnt[i][k] == divpcnt[j][k]) {
            c[i][ecnt[i]] *= (long long)(divpcnt[i][k]+1);
            c[i][ecnt[i]] %= mod_num;
          }
        }
        ecnt[i]++;
      }
    }
    sum += ecnt[i];
  }
  
  for (int i = 0; i < divcnt; i++) {
    dp[i] = 1LL;
  }
  
  while (dp[divcnt-1] > 0LL) {
    ans += dp[divcnt-1]%mod_num;
    for (int i = divcnt-1; i >= 0; i--) {
      if (dp[i] > 0LL) {
        dp[i] %= mod_num;
        for (int j = 0; j < ecnt[i]; j++) {
          dp[e[i][j]] += dp[i]*c[i][j];
        }
      }
      dp[i] = 0LL;
    }
  }
  
  printf("%lld\n", ans%mod_num);
  return 0;
}