#include <iostream>

struct Triple{long x,y,z;};


long gcd(long a, long b)						 //Eulidean Algorithm
{
	if (a < b)
		gcd(b,a);
	if (b == 0)
		return a;
	return gcd(b,a%b);
}

int main()
{
	long N = 10000;
	long prime_triples_count = 0, triples_count = 0, p_count = 0;
	
	Triple sols[50000];

	for (long z = 1; z <= N; z++)					 
	{		
		for (long y = 1; y < z; y++)
		{			
			for (long x = 1; x < y; x++)
		 {			 
			 if (z*z == (y*y) + (x*x))			 
			 {						 		
				    sols[triples_count].x=x; 
					sols[triples_count].y=y; 
					sols[triples_count].z=z;
				 triples_count++;													 
				 if (gcd(x,y) == 1 && gcd(x,z) == 1 && gcd(y,z) == 1)
					 prime_triples_count++;										 
				}
			}
		}
	}

	for (long p = 1; p <= N; p++)		 
	{		
		long i;
		for (i = 0; i < triples_count; i++)	
	 {				 		
			if (p == sols[i].x || p == sols[i].y || p == sols[i].z)
				break;
		}		
		if (i >= triples_count)		   
		{
			p_count++;		
		}
	}
	
	std::cout<<prime_triples_count<<&quot; &quot;<<p_count<<&quot;\n&quot;;	 
			
	return 0;
}