#include <bits/stdc++.h>

using namespace std;

class rolling_hash {
  int base;
  int mod;
  vector<unsigned long long> hash;
  vector<unsigned long long> pow;
  
public:
  rolling_hash(const string &s, int b = 1123, int m = 1e9+7) {
    base = b;
    mod = m;
    int n = s.length();
    hash.resize(n + 1);
    pow.resize(n + 1);
    pow[0] = 1;
    for (int i = 0; i < n; i++) {
      hash[i+1] = (base * hash[i] + s[i]) % mod;
      pow[i+1] = base * pow[i] % mod;
    }
  }

  // l, r are 0-based index
  unsigned long long get(int l, int r) {
    ++r;
    unsigned long long ret = hash[r] - hash[l] * pow[r - l] % mod;
    ret = (ret % mod + mod) % mod;
    return ret;
  }

  unsigned long long calc(const string &s) {
    unsigned long long ret = 0;
    for (char c: s)
      ret = (base * ret + c) % mod;
    return ret;
  }
};

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  string s;
  cin >> s;

  rolling_hash h(s);
  int m;
  cin >> m;
  int ret = 0;
  for (int i = 0; i < m; i++) {
    string t;
    cin >> t;
    unsigned long long g = h.calc(t);
    for (int j = 0; j + t.length() <= s.length(); j++) {
      if (g == h.get(j, j + t.length() - 1)) {
        bool ck = true;
        for (int k = 0; k < t.length(); k++)
          ck &= s[j+k] == t[k];
        if (ck)
          ++ret;
      }
    }
  }
  cout << ret << endl;
  
  return 0;
}