Ivan has number b. He is sorting through the numbers a from 1 to 10^{18}, and for every a writes ([a,    b])/(a) on blackboard. Here [a,    b] stands for least common multiple of a and b. Ivan is very lazy, that's why this task bored him soon. But he is interested in how many different numbers he would write on the board if he would finish the task. Help him to find the quantity of different numbers he would write on the board.

Input

The only line contains one integer — b (1 ≤ b ≤ 10^{10}).

Output

Print one number — answer for the problem.

Examples

Input

1


Output

1

Input

2


Output

2

Note

In the first example [a,    1] = a, therefore ([a,    b])/(a) is always equal to 1.

In the second example [a,    2] can be equal to a or 2 ⋅ a depending on parity of a. ([a,    b])/(a) can be equal to 1 and 2.
import java.io.*;
import java.text.DecimalFormat;
import java.util.*;
public class Main
{


    public static long primeFactors(long n) 
    { 
        long count = 0;
        long ans = 1;
        while (n%2==0) 
        { 
            count++;
            // System.out.print(2 + " "); 
            n /= 2; 
        } 
        ans *= count+1;
        count = 0;
        for (long i = 3; i <= Math.sqrt(n); i+= 2) 
        { 
            count = 0;
            while (n%i == 0) 
            { 
                count++;
                // System.out.print(i + " "); 
                n /= i; 
            } 
            ans*=count+1;
        } 
  
        if (n > 2) {
            ans*=2;
            // System.out.print(n); 
        }
        return ans;
    } 
    public static void main(String[] args) throws Exception
    {
       Reader in = new Reader();
       int t = 1;
    //    t = ni();
       while(t-->0){
           long n = nl();
           pr(primeFactors(n));
       }
       sop(ans);
    }
    static final long mod=1000000007l;
    static StringBuilder ans=new StringBuilder();
    static Reader in=new Reader();
    static final double eps=1e-9;
 
    //////////////////////////////////
    ////input functions/////////////////
    static int ni(){return Integer.parseInt(in.next());}
    static long nl(){return Long.parseLong(in.next());}
    static String ns(){return in.next();}
    static double nd(){return Double.parseDouble(in.next());}
    static int[] nia(int n){int a[]=new int[n];for(int i=0; i<n; i++)a[i]=ni();return a;}
    static int[] pnia(int n){int a[]=new int[n+1];for(int i=1; i<=n; i++)a[i]=ni();return a;}
    static long[] nla(int n){long a[]=new long[n];for(int i=0; i<n; i++)a[i]=nl();return a;}
    static String[] nsa(int n){String a[]=new String[n];for(int i=0; i<n; i++)a[i]=ns();return a;}
    static double[] nda(int n){double a[]=new double[n];for(int i=0; i<n; i++)a[i]=nd();return a;}
 
    //////output functions////////////////
    static void pr(Object a){ans.append(a+"\n");}
    static void pr(){ans.append("\n");}
    static void p(Object a){ans.append(a);}
    static void pra(int[]a){for(int i:a)ans.append(i+" ");ans.append("\n");}
    static void pra(long[]a){for(long i:a)ans.append(i+" ");ans.append("\n");}
    static void pra(String[]a){for(String i:a)ans.append(i+" ");ans.append("\n");}
    static void pra(double[]a){for(double i:a)ans.append(i+" ");ans.append("\n");}
    static void sop(Object a){System.out.print(a);}
    static void sopln(Object a){System.out.println(a);}
    static void flush(){System.out.print(ans);ans=new StringBuilder();}
 
    static void exit(){System.out.print(ans);System.exit(0);}
    static int min(int... a){int min=a[0];for(int i:a)min=Math.min(min, i);return min;}
    static int max(int... a){int max=a[0];for(int i:a)max=Math.max(max, i);return max;} 
    static int gcd(int... a){int gcd=a[0];for(int i:a)gcd=gcd(gcd, i);return gcd;}  
    static long min(long... a){long min=a[0];for(long i:a)min=Math.min(min, i);return min;}
    static long max(long... a){long max=a[0];for(long i:a)max=Math.max(max, i);return max;} 
    static long gcd(long... a){long gcd=a[0];for(long i:a)gcd=gcd(gcd, i);return gcd;}  
    static String pr(String a, long b){String c="";while(b>0){if(b%2==1)c=c.concat(a);a=a.concat(a);b>>=1;}return c;}
    static long powm(long a, long b, long m){long an=1;long c=a;while(b>0){if(b%2==1)an=(an*c)%m;c=(c*c)%m;b>>=1;}return an;}
    static int gcd(int a, int b){if(b==0)return a;return gcd(b, a%b);}
    static long gcd(long a, long b){if(b==0)return a;return gcd(b, a%b);}
 
    static class Reader {
        BufferedReader reader;
        StringTokenizer tokenizer;
        public Reader() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }
        String next() {while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {tokenizer = new StringTokenizer(reader.readLine());}
                catch (IOException e) {throw new RuntimeException(e);}}
            return tokenizer.nextToken();}
        int nextInt() {return Integer.parseInt(next());}
        long nextLong() {return Long.parseLong(next());}
        double nextDouble() {return Double.parseDouble(next());}
    }
 
}