#include<fstream>
#include<bitset>

using namespace std;

ofstream out("dtcsu.out");



int hash_keys[5] = { 666013, 1000003, 826663, 797593, 959473 };

bitset<1000006> bloom_filter [5];

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		}
		else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		}
		else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};


int main()
{
	long long x;

	InParser in("dtcsu.in");

	for (int i = 1; i <= 276997; ++i)
	{
		in >> x;
		if(x&1)
			for (int j = 0; j < 5; ++j)
				bloom_filter[j][x%hash_keys[j]] = 1;
	}

	int Q,nr=0;

	in >> Q;

	for (int i = 1; i <= Q; ++i)
	{
		in >> x;
		int j;
		for (j = 0; j < 5; ++j)
			if (bloom_filter[j][x%hash_keys[j]] == 0)
				break;
		if (x)
			x /= x&(-x);
		if (j == 5)
		{

			while (x % 15 == 0)
				x /= 15;
			while (x % 3 == 0)
				x /= 3;

			while (x % 5 == 0)
				x /= 5;

			while (x % 7 == 0)
				x /= 7;

			while (x % 11 == 0)
				x /= 11;

			nr += (x == 1);
		}
	}

	out << nr;

	return 0;
}