#include <fstream>
#include <cstdio>
#include <unordered_set>
using namespace std;

unordered_set<long long> hashtable;
string nr;

int main() {
  ifstream in("dtcsu.in");
  for (int i = 0; i < 276997; ++i) {
    getline(in, nr);

    /*long long n = 0;
    int size = nr.size();
    for (int j = 0; j < size; ++j) {
      n = n*10 + nr[j];
    }

    hashtable.insert(n);*/
  }

  int Q, rez = 0;
  scanf("%d", &Q);
  char c;
  scanf("%c", &c);

  for (int i = 0; i < Q; ++i) {
    getline(in, nr);
    long long n = 0;
    int size = nr.size();
    for (int j = 0; j < size; ++j) {
      n = n*10 + nr[j];
    }

    while (!(n & 1)) {
      n /= 2;
    }
    while (n % 3 == 0) {
      n /= 3;
    }
    while (n % 5 == 0) {
      n /= 5;
    }
    while (n % 7 == 0) {
      n /= 7;
    }
    while (n % 11 == 0) {
      n /= 11;
    }

    if (n == 1) {
      ++rez;
    }

  }

  ofstream out("dtcsu.out");
  out << rez;
  return 0;
}