using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = long.Parse(ReadLine());
        var dic = new Dictionary<long, int>();
        var tmp = n;
        for (var i = 2; i <= 1000000; ++i)
        {
            while (tmp % i == 0)
            {
                if (dic.ContainsKey(i)) ++dic[i];
                else dic[i] = 1;
                tmp /= i;
            }
        }
        if (tmp > 1)
        {
            var ok = 1_000_000_000L;
            var ng = 0L;
            while (ok - ng > 1)
            {
                var mid = (ok + ng) / 2;
                if (mid * mid >= tmp) ok = mid;
                else ng = mid;
            }
            if (ok * ok == tmp) dic[ok] = 2;
            else dic[ok] = 1;
        }
        var ans = 1L;
        foreach (var kv in dic)
        {
            var dp = new long[kv.Value + 1][];
            for (var i = 0; i < dp.Length; ++i) dp[i] = new long[kv.Value + 1];
            for (var i = 1; i <= kv.Value; ++i) dp[i][i] = 1;
            for (var i = 1; i < kv.Value; ++i)
            {
                for (var j = i; j < kv.Value; ++j)
                {
                    for (var k = i; j + k <= kv.Value; ++k)
                    {
                        dp[k][j + k] += dp[i][j];
                    }
                }
            }
            ans *= dp.Sum(di => di[kv.Value]);
        }
        WriteLine(ans);
    }
}