#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pd(a) printf("%.10f\n",a)
#define pb(a) push_back(a)
#define in(a) insert(a)
#define pi M_PI
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
template<C T>void pr(T a){cout<<a;ln;}
template<C T,C T2>void pr(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
int fail[500010];
void buildFail(string p) {
  int m=p.size();
  int j=fail[0]=-1;
  for(int i=1;i<=m;i++) {
    while(j>=0&&p[j]!=p[i-1])j=fail[j];
    fail[i]=++j;
  }
}
int match(string t,string p) {
  int n=t.size(),m=p.size();
  int count=0;
  for (int i=0,k=0;i<n;++i) {
    while(k>=0&&p[k]!=t[i])k=fail[k];
    if(++k>=m) {
      count++;
      k=fail[k];
    }
  }
  return count;
}
void Main() {
  string s;
  int n;
  cin >> s >> n;
  buildFail(s);
  ll ans=0;
  while(n--) {
    string t;
    cin >> t;
    ans+=match(s,t);
  }
  pr(ans);
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  Main();return 0;
}