#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#include <fstream>
#include <algorithm>
#include <string>
#include <iomanip>
#include <cstring>
#include <map>
#include <iomanip>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <cctype>
#include <unordered_set>
#define MOD 666013
#define pb push_back
#define INF 0x3f3f3f3f
#define INFLL (1LL*INF*INF)
#define ll long long
#define NMAX 10000005

using namespace std;

typedef pair<int, int> pii;

ifstream fin("abc2.in");
ofstream fout("abc2.out");

char s[NMAX],word[50005];
vector<int> Hash[MOD];

void insertHash(unsigned x) {
    int lista=x%MOD;

    Hash[lista].pb(x);
}

bool findHash(unsigned x) {
    int lista=x%MOD;

    for(auto it:Hash[lista])
        if(it==x) return 1;

    return 0;
}

int main() {
	int i,lg;
	unsigned val,p3;
	ll res=0;

	fin>>s;
	while(!fin.eof()) {
		fin>>word;

		lg=val=i=0;
		while(word[i]) {
			val=(val*3+word[i]-'a');
			++i;
			++lg;
		}

		if(!findHash(val)) insertHash(val);
	}

	val=0;
	p3=3;
	for(i=0;i<lg-1;++i) {
		val=(val*3+s[i]-'a');
		p3*=3;
	}

	for(;s[i];++i) {
		val=(val*3+s[i]-'a');
		val%=p3;
		res+=findHash(val);
	}

	fout<<res;

	return 0;
}