#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <class T>
inline bool setmin(T &a, T b) {
  if (a > b) return a = b, 1;
  return 0;
}
template <class T>
inline bool setmax(T &a, T b) {
  if (a < b) return a = b, 1;
  return 0;
}
template <class T>
inline T fast(T a, T b, T mod) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T>
inline T russian(T a, T b, T mod) {
  long long res = 0;
  while (b) {
    if (b & 1) res = (res + a) % mod;
    a = (a + a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T>
istream &operator>>(istream &os, vector<T> &container) {
  for (auto &u : container) os >> u;
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &container) {
  for (auto &u : container) os << u << " ";
  return os;
}
template <typename T>
inline T gcd(T a, T b) {
  while (b) swap(a %= b, b);
  return a;
}
const long long T = 1 << 18;
const long long INF = 1e9 + 7;
const long long mod = 998244353;
const long long BIG_INF = 1e18 + 7;
const long long N = 1e6 + 7;
const int LOG = 21;
long long m, k;
string w;
vector<int> Z(string second) {
  int n = (int)second.length();
  vector<int> z(n, 0);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && second[z[i]] == second[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
vector<int> prefixy(string &a, string &b) {
  string pom = a;
  pom += "$";
  pom += b;
  vector<int> fz = Z(pom);
  return vector<int>(fz.begin() + (int)(a).size() + 1, fz.end());
}
vector<int> sufixy(string a, string b) {
  reverse((a).begin(), (a).end()), reverse((b).begin(), (b).end());
  string pom = a;
  pom += "$";
  pom += b;
  vector<int> fz = Z(pom);
  fz = vector<int>(fz.begin() + (int)(a).size() + 1, fz.end());
  reverse((fz).begin(), (fz).end());
  return fz;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> w;
  cin >> m;
  int ans = 0;
  for (int i = 0; i < (m); i++) {
    string temp;
    cin >> temp;
    if ((int)(temp).size() == 1) continue;
    vector<int> P = prefixy(temp, w);
    vector<int> maxy;
    maxy.push_back(0);
    for (auto &u : P) maxy.push_back(max(u, maxy.back()));
    vector<int> S = sufixy(temp, w);
    for (int j = (int)(w).size() - 1; j >= (int)(temp).size() - 1; j--) {
      int poz = j - (int)(temp).size() + 1;
      if (maxy[poz + 1] >= (int)(temp).size() - S[j]) {
        ans++;
        break;
      }
    }
  }
  cout << ans;
}
