#include <iostream>

using namespace std;

int prim(int numarator, int numitor)
{
	int x;
	while (numitor)
	{
		x = numarator % numitor;
		numarator = numitor;
		numitor = x;
	}
	if (numarator == 1)
		return 1;
	return 0;
}

int main()
{
	int fractii = 0, n=4;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (prim(i, j))
				fractii++;

	cout << fractii;
}