//  https://yukicoder.me/problems/no/430

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep0(i,n) for(int i=0; i<n; ++i)
#define rep1(i,n) for(int i=1; i<=n; ++i)

void create_table(int *table, string pattern){
  int N = pattern.length();
  int j = 0;
  table[j] = 0;
  rep1(i, N-2){
    if(pattern[i] == pattern[j]){
      j += 1;
      table[i] = j;
    }
    else{
      while( pattern[i] != pattern[j] && j!=0 ){
        j = table[j-1];
      }
      if(pattern[i] == pattern[j]) j+=1;
      table[i] = j;
    }
  }
}

int KMP(string text, string pattern, int *table){
  int ans = 0;
  int t_len = text.length();
  int p_len = pattern.length();
  int t_i = 0;
  int p_i = 0;
  while( t_i<t_len ){
    if(text[t_i] == pattern[p_i]){
      t_i += 1;
      p_i += 1;
    }
    else if(p_i == 0) t_i += 1;
    else p_i = table[p_i - 1];
    if(p_i == p_len){
      ans += 1;
      p_i = 0;
      t_i -= (p_len - 1);
    }
  }
  return ans;
}

int main(){
  string S;
  cin >> S;
  int M;
  cin >> M;

  int ans = 0;
  rep1(i, M){
    string C;
    cin >> C;
    if(C.length() != 1){
      int table[C.length()-1];
      create_table(table, C);
      ans += KMP(S, C, table);
    }
    else{
      int table = 1;
      ans += KMP(S, C, &table);
    }
  }
  cout << ans << endl;
}