#include <bits/stdc++.h>
using namespace std;

// T = string or vector<ll>
template <class T> struct KMP {
  T pat;
  vector<int> fail;

  // construct
  KMP(const T &p) { init(p); }
  void init(const T &p) {
    pat = p;
    int m = (int)pat.size();
    fail.assign(m + 1, -1);
    for (int i = 0, j = -1; i < m; ++i) {
      while (j >= 0 && pat[i] != pat[j])
        j = fail[j];
      fail[i + 1] = ++j;
    }
  }

  // the period of S[0:i]
  int period(int i) { return i - fail[i]; }

  // the index i such that S[i:] has the exact prefix p
  vector<int> match(const T &S) {
    int n = (int)S.size(), m = (int)pat.size();
    vector<int> res;
    for (int i = 0, k = 0; i < n; ++i) {
      while (k >= 0 && S[i] != pat[k])
        k = fail[k];
      ++k;
      if (k >= m)
        res.push_back(i - m + 1), k = fail[k];
    }
    return res;
  }
};

int main() {
  string s;
  cin >> s;
  int m;
  cin >> m;
  vector<string> c(m);
  int ans = 0;
  for (int i = 0; i < m; i++) {
    cin >> c[i];
    KMP<string> kmp(c[i]);
    ans += kmp.match(s).size();
  }
  cout << ans << endl;
}