Problem: Yaroslav, Andrey and Roman love playing cubes. Sometimes they get together and play cubes for hours and hours! 

Today they got together again and they are playing cubes. Yaroslav took unit cubes and composed them into an a × a × a cube, Andrey made a b × b × b cube and Roman made a c × c × c cube. After that the game was finished and the guys left. But later, Vitaly entered the room. He saw the cubes and wanted to make a cube as well. But what size should the cube be? Of course it should be a large cube with the side of length a + b + c. Besides, Vitaly decided to decompose the cubes built by Yaroslav, Andrey and Roman and compose his own large cube out of them. However, it turned out that the unit cubes he got from destroying the three cubes just weren't enough to make a large cube. We know that Vitaly was short of exactly n cubes. Vitaly got upset, demolished everything and left. As he was leaving, he met Petya and told him that there had been three cubes in the room and that he needed another n unit cubes to make his own large cube.

Petya entered the room and saw the messily scattered cubes. He wanted to make it neat and orderly again. But he only knows that there had been three cubes, made of small unit cubes and that Vitaly needed n more unit cubes to make a large one! Help Petya understand, how many ways of sizes a, b, c are there to restore Yaroslav's, Andrey's and Roman's cubes.

Input

The single line of the input contains integer n (1 ≤ n ≤ 1014). We know that all numbers a, b, c are positive integers.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

Output

In the single line print the required number of ways. If it turns out that there isn't a single way of suitable sizes of a, b, c, print 0. 

Examples

Input

24


Output

1


Input

648


Output

7


Input

5


Output

0


Input

93163582512000


Output

39090

Solution (in JAVA):

Solution:
import static java.lang.Math.*;
import static java.lang.System.currentTimeMillis;
import static java.lang.System.exit;
import static java.lang.System.arraycopy;
import static java.util.Arrays.sort;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.fill;
import java.util.*;
import java.awt.geom.QuadCurve2D;
import java.io.*;

public class Copy_2_of_Main {

	public static void main(String[] args) throws IOException {
		try {
			if (new File("input.txt").exists())
				System.setIn(new FileInputStream("input.txt"));
		} catch (SecurityException e) {
		}
		new Thread(null, new Runnable() {
			public void run() {
				try {
					long time1 = System.currentTimeMillis();
					new Copy_2_of_Main().run();
					long time2 = System.currentTimeMillis();
					System.err.println("Time " + (time2 - time1) + " ms");
				} catch (Throwable e) {
					e.printStackTrace();
					exit(999);
				}
			}
		}, "1", 1 << 23).start();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer st = new StringTokenizer("");

	private void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		solve();
		in.close();
		out.close();
	}

	private void solve() throws IOException {
		long n = nextLong();
		if (n % 3 != 0) {
			out.println(0);
			return;
		}
		
		n /= 3;
		
		Set<long[]> set = new TreeSet<long[]>(new Comparator<long[]>() {

			@Override
			public int compare(long[] o1, long[] o2) {
				for (int i = 0; i < o1.length; i++)
					if (o1[i] != o2[i])
						return o1[i] < o2[i] ? -1 : 1;
				return 0;
			}
		});
		
		for (long x = 1L; x * x * x <= n; x++) {
			if (n % x != 0)
				continue;
			long m = n / x;
			for (long y = max(x, (long)(sqrt(n / 2 / x) + 0.001)); y * y <= m; y++) {
				if (m % y != 0)
					continue;
				long z = m / y;
				if (((x ^ y ^ z) & 1) != 0)
					continue;
				long u = (x + y + z) >> 1;
				long a = u - z;
				long b = u - y;
				long c = u - x;
				if (a > 0 && b > 0 && c > 0) {
					long[] q = new long[] { a, b, c };
					sort(q);
					set.add(q);
				}
			}
		}
		
		long[] f = {1, 1, 3, 6};
		
		long ans = 0;
		for (long[] t : set) {
			int count = 1;
			if (t[0] != t[1])
				count++;
			if (t[1] != t[2])
				count++;
			ans += f[count];
		}
		
//		System.err.println(set.size());
//		System.err.println(ans / 39090.);
		
		out.println(ans);
	}
	
	long pw3(long a) {
		return a * a * a;
	}

	class T implements Comparable<T> {
		long a, b, c;

		public T(long... x) {
			sort(x);
			this.a = x[0];
			this.b = x[1];
			this.c = x[2];
		}

		@Override
		public int compareTo(T t) {
			int cmp1 = Long.compare(a, t.a);
			if (cmp1 != 0)
				return cmp1;
			int cmp2 = Long.compare(b, t.b);
			if (cmp2 != 0)
				return cmp2;
			return Long.compare(c, t.c);
		}
		
	}
	
	void chk(boolean b) {
		if (b)
			return;
		System.out.println(new Error().getStackTrace()[1]);
		exit(999);
	}
	void deb(String fmt, Object... args) {
		System.out.printf(Locale.US, fmt + "%n", args);
	}
	String nextToken() throws IOException {
		while (!st.hasMoreTokens())
			st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}
	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}
	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}
	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
	String nextLine() throws IOException {
		st = new StringTokenizer("");
		return in.readLine();
	}
	boolean EOF() throws IOException {
		while (!st.hasMoreTokens()) {
			String s = in.readLine();
			if (s == null)
				return true;
			st = new StringTokenizer(s);
		}
		return false;
	}
}