#include<queue>

 #include<cstdio>

 #include<cctype>

 inline int getint() {

     register char ch;

     while(!isdigit(ch=getchar()));

     register int x=ch^'';

     while(isdigit(ch=getchar())) x=(((x<<)+x)<<)+(ch^'');

     return x;

 }

 const int N=1e6+,S=;

 char s[N];

 int ans=;

 class AhoCorasick {

     private:

         std::queue<int> q;

         int val[N],ch[N][S],fail[N];

         int sz,new_node() {

             return ++sz;

         }

         int idx(const char &c) const {

             return c-'a';

         }

     public:

         void insert(const char s[]) {

             int p=;

             for(register int i=;s[i];i++) {

                 if(!ch[p][idx(s[i])]) ch[p][idx(s[i])]=new_node();

                 p=ch[p][idx(s[i])];

             }

             val[p]++;

         }

         void get_fail() {

             for(register int i=;i<S;i++) {

                 if(ch[][i]) q.push(ch[][i]);

             }

             while(!q.empty()) {

                 const int &x=q.front();

                 for(register int i=;i<S;i++) {

                     if(!ch[x][i]) {

                         ch[x][i]=ch[fail[x]][i];

                         continue;

                     }

                     fail[ch[x][i]]=ch[fail[x]][i];

                     q.push(ch[x][i]);

                 }

                 q.pop();

             }

         }

         void find(const char s[]) {

             int p=;

             for(register int i=;s[i];i++) {

                 p=ch[p][idx(s[i])];

                 for(register int q=p;q&&~val[q];q=fail[q]) {

                     ans+=val[q];

                     val[q]=-;

                 }

             }

         }

 };

 AhoCorasick ac;

 int main() {

     const int n=getint();

     for(register int i=;i<n;i++) {

         scanf("%s",s);

         ac.insert(s);

     }

     ac.get_fail();

     scanf("%s",s);

     ac.find(s);

     printf("%d\n",ans);

     return ;

 }