Problem:
Score : 400 points

Problem Statement

Given are positive integers A and B.

Let us choose some number of positive common divisors of A and B.

Here, any two of the chosen divisors must be coprime.

At most, how many divisors can we choose?

Definition of common divisor

An integer d is said to be a common divisor of integers x and y when d divides both x and y.

Definition of being coprime

Integers x and y are said to be coprime when x and y have no positive common divisors other than 1.

Definition of dividing

An integer x is said to divide another integer y when there exists an integer \alpha such that y = \alpha x.

Constraints

All values in input are integers.

1 \leq A, B \leq 10^{12}

Input

Input is given from Standard Input in the following format:

A B

Output

Print the maximum number of divisors that can be chosen to satisfy the condition.

Sample Input 1

12 18

Sample Output 1

3

12 and 18 have the following positive common divisors: 1, 2, 3, and 6.

1 and 2 are coprime, 2 and 3 are coprime, and 3 and 1 are coprime, so we can choose 1, 2, and 3, which achieve the maximum result.

Sample Input 2

420 660

Sample Output 2

4

Sample Input 3

1 2019

Sample Output 3

1

1 and 2019 have no positive common divisors other than 1.

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;

namespace AtCoder
{
	// ABC138D X
	public class ABC
	{
		static void Main(string[] args)
		{
			Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });


			long[] vs = Console.ReadLine().Split().Select(long.Parse).ToArray();
			long A = vs[0];
			long B = vs[1];

			var gcd = GCD(A, B);
			var ans = PrimeFactorization(GCD(A, B)).Distinct().Count() + 1;
			Console.WriteLine(ans);


			Console.Out.Flush();
		}

		#region 最大公約数
		static long GCD(long a, long b)
		{
			long tmp;
			if (a < b) {
				tmp = a;
				a = b;
				b = tmp;
			}
			if (b == 0) {
				return a;
			}
			do {
				tmp = a % b;
				a = b;
				b = tmp;
			} while (b != 0);
			return a;
		}
		#endregion

		#region 素因数分解
		static long[] PrimeFactorization(long x)
		{
			if (x < 2) { return new long[] { }; }

			List<long> ans = new List<long>();
			while (x % 2 == 0) {
				ans.Add(2);
				x /= 2;
			}
			for (int i = 3; i <= Math.Sqrt(x); i += 2) {
				while (x % i == 0) {
					ans.Add(i);
					x /= i;
				}
			}
			if (x > 1) {
				ans.Add(x);
			}
			return ans.ToArray();
		}
		#endregion

	}
}