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


public class Main {

    private static List<List<Integer>> subsets;
    private static int count = 0;
    private static BigInteger thirteen = new BigInteger("13");
    private static BigInteger five = new BigInteger("5");
    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        InputReader.OutputWriter out = new InputReader.OutputWriter(outputStream);
        Scanner scanner = new Scanner(System.in);

        long b = in.nextLong();
        if(isPrime(b)) {
            out.println(2);
        }
        else {
            int count = 0;
            for (long i = 1; i*i <=b; i++) {
                if(b%i==0) {
                    count++;
                    if(i*i!=b) count++;
                }
            }
            out.println(count);
        }

        /*long n = in.nextLong();
        long m = in.nextLong();
        long k = in.nextLong();
        long l = in.nextLong();

        if(l-k>n) {
            out.println(-1);
        }
        else {
            long max = n/m;
            if(max == 0) {
                out.println(-1);
            }
            else {
                long min = 1;
                while (min <= max) {
                    long med = min + (max - min) / 2;
                    if (med * m - k >= l) {
                        max = med - 1;
                    } else {
                        min = med + 1;
                    }
                }
                out.println(min);
            }
        }*/

        out.flush();
    }
    static boolean isPrime(long n) {
        if(n < 2) return false;
        for(long i = 2;i*i<=n;i++) {
            if(n%i==0) return false;
        }
        return true;
    }
    static long gcd(long a, long b) {
        return b == 0 ? a : gcd(b,a%b);
    }
    public boolean isPowerOfFour(int num) {
        int n = Integer.bitCount(num);
        String s = Integer.toBinaryString(num);
        if(n == 1 && s.length()%2!=0) return true;
        return false;
    }
    static boolean isAscending(int [] a) {
        for (int i = 0; i < a.length - 1; i++) {
            if(a[i+1] < a[i]) return false;
        }
        return true;
    }
    static boolean isDescending(int [] a) {
        for (int i = 0; i < a.length - 1; i++) {
            if(a[i+1] > a[i]) return false;
        }
        return true;
    }
    static void reverseArray(int [] a) {
        int i = 0;
        int j = a.length - 1;
        while (i<=j) {
            int temp = a[i];
            a[i] = a[j];
            a[j] = temp;
            i++;
            j--;
        }
    }
    static boolean isPossible(int [] a, int [] b) {
        for (int i = 0; i < 26; i++) {
            if(a[i] == 0  && b[i]!=0) return false;
        }
        return true;
    }
    private static int [] freq(String s) {
        int [] f = new int[26];
        for (char c : s.toCharArray()) {
            f[c-'a']++;
        }
        return f;
    }
    private static void dfs(HashMap<Integer,List<Integer>> map, HashMap<Integer,Long> values, int x, int v,HashSet<Integer> set) {
        if(!set.contains(x)) {
            values.put(x, values.getOrDefault(x, 0L) + v);
            set.add(x);
        }
        if(!map.containsKey(x)) {
            return;
        }
        List<Integer> list = map.get(x);
        for (int i = 0; i < list.size(); i++) {
            int key = list.get(i);
            if(!set.contains(key)) {
                values.put(key,values.get(key) +  v);
                set.add(key);
            }
        }
        for (int i = 0; i < list.size();i++) {
            int key = list.get(i);
            dfs(map,values,key,v,set);
        }
    }

    static double gcd(double a,double b) {
        return b == 0 ? a : gcd(b,a%b);
    }
}
class Point {
    int id;
    int value;

    public Point(int id, int value) {
        this.id = id;
        this.value = value;
    }
}

class InputReader extends BufferedReader {
    StringTokenizer tokenizer;

    public InputReader(InputStream inputStream) {
        super(new InputStreamReader(inputStream), 32768);
    }

    public InputReader(String filename) {
        super(new InputStreamReader(Thread.currentThread().getContextClassLoader().getResourceAsStream(filename)));
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(readLine());
            } catch (IOException e) {
                throw new RuntimeException();
            }
        }
        return tokenizer.nextToken();
    }
    public Integer nextInt() {return Integer.valueOf(next());}
    public Long nextLong() {return  Long.valueOf(next());}
    public Double nextDouble() {return Double.valueOf(next());}

    static class OutputWriter extends PrintWriter {
        public OutputWriter(OutputStream outputStream) {
            super(outputStream);
        }

        public OutputWriter(Writer writer) {
            super(writer);
        }

        public OutputWriter(String filename) throws FileNotFoundException {
            super(filename);
        }

        public void close() {
            super.close();
        }
    }
}