/* 
 * Problem  : 	DIVISOR
 * Contest  : 	UOI-2006 (Dnepropetrovsk)
 * Type     : 	Test Generation
 * Date     : 	March 28, 2006
 * Author   : 	Shamil Yagiyayev
 * Language :	C#
 * Compiler :	.NET 1.1
 * Algorithm:	Predefined tests
 */


using System.IO;

class GenDivisorTests
{
	
	static long Process(int n)
	{
		int[] cnt = new int[n+1]; // everything is 0
		bool[] prime = new bool[n+1]; // everything is false

		for (int i=2; i<=n; i++)
		{
			int curr = i;
			for (int j=2; j<i;j++) 
			{
				if (prime[j]) 
					while (curr % j == 0)
					{
						curr /= j; 
						cnt[j]++;
					}
			}

			if (curr == i)
			{
				cnt[i]++;
				prime[i]=true;
			}
		}

		long result = 1;
		for (int i=2; i<=n; i++) result *= cnt[i]+1;

		return result;
	}

	static int[] data = {1,2,3,4,7,9,11,12,13,15,18,19,20,22,26,29,31,37,42,45, 4};

	static void Main()
	{
		StreamWriter swSummary = File.CreateText("divisor.tests.csv");

		for(int test=1; test<=21; test++)
		{
//			StreamWriter swDat = File.CreateText(string.Format("divisor.{0}.dat", test));
//			swDat.WriteLine("{0}", data[test-1]);
//			swDat.Close();

			long sol = Process(data[test-1]);

//			StreamWriter swSol = File.CreateText(string.Format("divisor.{0}.eta", test));
//			swSol.WriteLine("{0}", sol);
//			swSol.Close();	

			swSummary.WriteLine("{0};{1};{2};{3}", test, data[test-1], sol, test==21 ? "Тест із умови" : "");
		}

		swSummary.Close();
	}

}