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

//
#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0, sizeof(x))
#define mm(x) memset((x), -1, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define bit(n) (1LL << (n))
#define bitset(a, b) (a) |= (1 << (b))
#define bitunset(a, b) (a) |= ~(1 << (b))
#define bitcheck(a, b) ((((a) >> (b)) & 1) == 1)
#define bitcount(a) __builtin_popcountll((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
const int INF = (int)1e18;
const int MOD = (int)1e9 + 7;
const double EPS = (double)1e-10;
const int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
};

//Rolling Hash
//ｎ文字の数列の中にm文字の数列が含まれるかどうか
//mod 2^64　のため衝突する恐れあり。

struct RollingHash {
  const ull B = 1e9 + 7; //基数

  //aはbにいくつ含まれているか？
  int contain(string a, string b) {
    int al = a.length(), bl = b.length();
    if (al > bl) return false;

    //B^al
    ull t = 1;
    for (int i = 0; i < al; i++) t *= B;

    //a,bの最初のal文字のハッシュ
    ull ah = 0, bh = 0;
    for (int i = 0; i < al; i++) ah = ah * B + a[i];
    for (int i = 0; i < al; i++) bh = bh * B + b[i];

    int cont = 0;
    for (int i = 0; i + al <= bl; i++) {
      if (ah == bh) cont++;
      if (i + al < bl) bh = bh * B + b[i + al] - b[i] * t;
    }
    return cont;
  }

  //aの末尾とbの先頭を何文字重ねることができるか？
  int overlap(string a, string b) {
    int al = a.length(), bl = b.length();
    int ans = 0;
    ull ah = 0, bh = 0, t = 1;
    for (int i = 1; i <= min(al, bl); i++) {
      ah = ah + a[al - i] * t;
      bh = bh * B + b[i - 1];
      if (ah == bh) ans = i;
      t *= B;
    }
    return ans;
  }
};

signed main() {
  string s;
  cin >> s;
  int M;
  cin >> M;

  RollingHash roll;

  int ans = 0;
  for (int i = 0; i < M; i++) {
    string c;
    cin >> c;
    ans += roll.contain(c, s);
  }

  cout << ans << endl;
  return 0;
}