#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define PII pair < int , int >
#define MOD 1000000007
 
using namespace std;
 
int n, rs;
string s, c[50100];
unordered_map < ll, int > M;
map < string, bool > N;
 
ll val, base = 1, divv = 1, sum;
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
 
    ifstream cin("abc2.in");
    ofstream cout("abc2.out");
 
    cin >> s;
    while (cin >> c[++n]);
 
    int len = c[1].size();
 
    for (int i = 0; i < s.size(); i++, base *= 3) {
        val += base * (s[i]);
        ll value = val;
        
        if (i >= len) {
            sum += divv * (s[i - len]);
            divv *= 3;
 
            value -= sum;
            value /= divv;
 
            ++M[value];
        }
 
        if (i == len - 1) ++M[value];
    }
 
    for (int i = 1; i < n; i++) {
        if (N[c[i]]) continue;
        N[c[i]] = 1;
 
        ll value = 0, base = 1;
        for (int j = 0; j < len; j++, base *= 3) {
            value += base * (c[i][j]);
        }
 
        // cout << value << " ";
 
        rs += M[value];
    }
 
    cout << rs;
 
    return 0;
}