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.*;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.stream.IntStream;

public class Main {
    InputStream is;
    BufferedReader bufferedReader;
    PrintWriter out;
    String INPUT = "";


    int row[] = { -1, 0, 1, 0 };
    int column[] = { 0, 1, 0, -1 };



    void solve() {

//       long n = nl();
//       long m = nl();
//       long k = nl();
//       long l = nl();
//
////       if (k == n) {
////           out.println(-1);
////           return;
////       }
//
//        if (k >= l) {
//            out.println(0);
//            return;
//        }
//       if (m > n) {
//           out.println(-1);
//           return;
//       }
//
//       if (n - k < m) {
//           out.println(-1);
//           return;
//       }
//
//       long diff = (n - k);
//       long perHead = diff/m;
//       if (perHead * m < l - k){
//           out.println(-1);
//           return;
//       }
//
//       long tt = (l-k)/m;
//       if (tt == 0) {
//           out.println(1);
//           return;
//       } else if ((l-k) % m == 0) {
//           out.println(tt);
//           return;
//       } else {
//           out.println(tt+1);
//           return;
//       }

        long n = nl();

        Set<Integer> set = new HashSet<>();

        if (n == 1) {
            out.println(1);
        } else if (n == 2) {
            out.println(2);
        } else {
            int count = 0;
            for (int i = 1; i <= Math.sqrt(n); ++i) {
                if (n%i == 0) {
                    if (n/i == i) {
                        count++;
                    }
                    else {
                        count+=2;
                    }
                }
            }
            out.println(count);

        }

    }

    boolean isPrime(long n) {
        //check if n is a multiple of 2
        if (n%2==0) return false;
        //if not, then just check the odds
        for(int i=3;i*i<=n;i+=2) {
            if(n%i==0)
                return false;
        }
        return true;
    }

    boolean compute(long n, long sub, Map<Long, Boolean> map) {
        if (map.get(sub) == null && (n-sub > sub || n - sub == 0 )) {
            return true;
        } else {
            return false;
        }
    }

    private int solve (char[][]matrix, int x, int y, int ml, int mr, int sx, int sy, int n, int m, boolean[][] visit) {
        if (x < 0 || y < 0 || x >= n || y >= m || visit[x][y]) {
            visit[x][y] = true;
            return 0;
        }

        visit[x][y] = true;


        if (matrix[x][y] == '*') {
            return 0;
        }
        if (y <= sy && sy - y <= ml) {
            return  1 +  solve(matrix, x+1, y, ml, mr, sx, sy, n, m, visit) + solve(matrix, x, y+1, ml, mr, sx, sy, n, m, visit)
                    + solve(matrix, x-1, y, ml, mr, sx, sy, n, m, visit) +solve(matrix, x, y-1, ml, mr, sx, sy, n, m, visit);

        }
        else if (y >= sy && y - sy <= mr) {
            return  1 + solve(matrix, x+1, y, ml, mr, sx, sy, n, m, visit) + solve(matrix, x, y+1, ml, mr, sx, sy, n, m, visit)
                    + solve(matrix, x-1, y, ml, mr, sx, sy, n, m, visit) +solve(matrix, x, y-1, ml, mr, sx, sy, n, m, visit);

        }
        return 0;
    }

    private BigInteger modulo(BigInteger a, BigInteger b, BigInteger c) {
        BigInteger t1 = a.mod(c);
        BigInteger t2 = b.mod(c);
        BigInteger t3 = t1.multiply(t2);
        return t3.mod(c);

//        BigInteger x= BigInteger.valueOf(1);
//        BigInteger y=a;
//        while(b.compareTo(BigInteger.valueOf(0)) > 0){
//            if(b.mod(BigInteger.valueOf(2)).equals( BigInteger.valueOf(1))){
//                x= x.multiply(y).mod(c);
//            }
//            y = y.multiply(y).mod(c); // squaring the base
//            b = b.divide(BigInteger.valueOf(2));
//        }
//        return x.mod(c);
    }

    private boolean sameBlock(String f, String t, int j) {
        return f.charAt(j) == '#' && t.charAt(j) == '#' || f.charAt(j) == '#' && t.charAt(j - 1) == '#' || f.charAt(j - 1) == '#' && t.charAt(j) == '#';
    }





    void run() throws Exception {
        is =  System.in;

        //is = new BufferedInputStream(new FileInputStream("./input.txt"));

        out = new PrintWriter(System.out);

        //out = new PrintWriter(new BufferedWriter(new FileWriter("./output.txt")));

        long s = System.currentTimeMillis();
        solve();
        //inputThird();
        out.close();
        //tr(System.currentTimeMillis()-s+"ms");
    }

    public static void main(String[] args) throws Exception {
        new Main().run();
    }

    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 boolean isNewLineChar(int c) { return c == 10;}

    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))){ // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private String nsTillNewLine() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isNewLineChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    private String nsF() {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while((isSpaceChar(b)) && b!=' '){ // when nextLine, (isSpaceChar(b) && b != ' ')
            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;
        long 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 boolean oj = System.getProperty("ONLINE_JUDGE") != null;
    private void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }
}