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.util.*;
import java.io.*;
import java.math.*;

public class PollardRho{

    void run(){
        System.out.println(RO.fak(nl()));
    }

    public static void main(String[] z){
        new PollardRho().run();
    }

    static class RO {

        static BigInteger ONE = new BigInteger("1");
        static BigInteger TWO = new BigInteger("2");
        static Random rnd = new Random();

        static ArrayList<BigInteger> v = new ArrayList<>();
        static HashMap<Long, Long> m = new HashMap();

        static public BigInteger rho(BigInteger N) {
            BigInteger divisor;
            BigInteger c = new BigInteger(N.bitLength(), rnd);
            BigInteger x = new BigInteger(N.bitLength(), rnd);
            BigInteger xx = x;
            if (N.mod(TWO).compareTo(BigInteger.ZERO) == 0) return TWO;
            do {
                x = x.multiply(x).mod(N).add(c).mod(N);
                xx = xx.multiply(xx).mod(N).add(c).mod(N);
                xx = xx.multiply(xx).mod(N).add(c).mod(N);
                divisor = x.subtract(xx).gcd(N);
            } while ((divisor.compareTo(ONE)) == 0);
            return divisor;
        }

        static public void factor(BigInteger N) {

            if (N.compareTo(ONE) == 0) return;
            if (N.isProbablePrime(20)) {
                v.add(N);
                return;
            }

            BigInteger divisor = rho(N);
            factor(divisor);
            factor(N.divide(divisor));
        }

        static long fak(long num) {
            BigInteger N = new BigInteger(num + "");
            factor(N);
            int sz = v.size();
            Collections.sort(v);
            long cnt = 0, tot = 1;
            for (int i = 0; i < sz; i++) {
                cnt = 0;
                while (i + 1 < sz && v.get(i).equals(v.get(i + 1))) {
                    cnt++;
                    i++;
                }
                cnt++;
                tot *= cnt+1;
            }
            return tot;
        }
    }



    InputStream is = System.in;
    private byte[] inbuf = new byte[1024];
    public int lenbuf = 0, ptrbuf = 0;

    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }

    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }

    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }

    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private String nline(){
        int b = readByte();
        StringBuilder sb = new StringBuilder();
        while (b!=10) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }

    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }

    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }

    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }

    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
}