#include <bits/stdc++.h>
using namespace std;
vector<int> prefixFunction(const string& s) {
  int n = s.size();
  int k = 0;
  vector<int> v(n + 1);
  v[1] = 0;
  for (int i = 2; i <= n; i++) {
    while (k > 0 && s[k] != s[i - 1]) k = v[k];
    if (s[k] == s[i - 1]) k++;
    v[i] = k;
  }
  return v;
}
vector<int> kmpMatcher(const string& text, const string& pattern) {
  vector<int> pi = prefixFunction(pattern);
  int matchCount = 0;
  int k = 0;
  vector<int> z;
  for (int i = 0; i < text.size(); i++) {
    while (k > 0 && text[i] != pattern[k]) k = pi[k];
    if (text[i] == pattern[k]) k++;
    z.push_back(k);
    if (k == pattern.size()) {
      matchCount++;
      k = pi[k];
    }
  }
  for (int i = 1; i < text.size(); i++) z[i] = max(z[i], z[i - 1]);
  return z;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  string rs(s);
  reverse(rs.begin(), rs.end());
  int n = s.size();
  int m;
  cin >> m;
  int ans = 0;
  while (m--) {
    string p;
    cin >> p;
    int x = p.size();
    if (x == 1) continue;
    string rp = p;
    reverse(rp.begin(), rp.end());
    vector<int> z1 = kmpMatcher(s, p);
    vector<int> z2 = kmpMatcher(rs, rp);
    reverse(z2.begin(), z2.end());
    for (int i = 0; i + 1 < n; i++) {
      if (z1[i] + z2[i + 1] >= x) {
        ans++;
        break;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
