public class Test {

  public static void main(String[] args) {

  System.out.println(phi(300));

  }

  public static int phi(int n)
  {
    int count=0;
    for (int i=1; i<n; i++)
      if (relPrime(i,n)) count++;
    return count;
  }
  public static boolean relPrime(int a, int b)
  {
    int smaller = a<b?a:b;
    for (int n=2; n<=smaller; n++)
    {
      if (a%n==0 && b%n==0)
        return false;
    }
    return true;
  }
}