#include <bits/stdc++.h>
 
using namespace std;
 
const int mod = 1e9 + 7;
 
struct TrieNode
{
  int nxt[27];
 
  int exist; // ???????????\???????????¨????????????????????°???????¨?
  vector< int > accept; // ???????????????id
 
  TrieNode() : exist(0)
  {
    memset(nxt, -1, sizeof(nxt));
  }
};
 
struct Trie
{
  vector< TrieNode > nodes;
  int root;
 
  Trie() : root(0)
  {
    nodes.push_back(TrieNode());
  }
 
  virtual void direct_action(int node, int id) {}
 
  virtual void child_action(int node, int child, int id) {}
 
  void update_direct(int node, int id)
  {
    nodes[node].accept.push_back(id);
    direct_action(node, id);
  }
 
  void update_child(int node, int child, int id)
  {
    ++nodes[node].exist;
    child_action(node, child, id);
  }
 
  void add(const string &str, int str_index, int node_index, int id)
  {
    if(str_index == str.size()) {
      update_direct(node_index, id);
    } else {
      const int c = str[str_index] - 'a';
      if(nodes[node_index].nxt[c] == -1) {
        nodes[node_index].nxt[c] = (int) nodes.size();
        nodes.push_back(TrieNode());
      }
      add(str, str_index + 1, nodes[node_index].nxt[c], id);
      update_child(node_index, nodes[node_index].nxt[c], id);
    }
  }
 
  void add(const string &str, int id)
  {
    add(str, 0, 0, id);
  }
 
  void add(const string &str)
  {
    add(str, nodes[0].exist);
  }
 
  int size()
  {
    return (nodes[0].exist);
  }
 
  int nodesize()
  {
    return ((int) nodes.size());
  }
};
 
struct Aho_Corasick : Trie
{
  static const int FAIL = 26;
  vector< int > correct;
 
  Aho_Corasick() : Trie() {}
 
  void build()
  {
    correct.resize(nodes.size());
    for(int i = 0; i < nodes.size(); i++) {
      correct[i] = (int) nodes[i].accept.size();
    }
 
    queue< int > que;
    for(int i = 0; i < 27; i++) {
      if(~nodes[0].nxt[i]) {
        nodes[nodes[0].nxt[i]].nxt[FAIL] = 0;
        que.emplace(nodes[0].nxt[i]);
      } else {
        nodes[0].nxt[i] = 0;
      }
    }
    while(!que.empty()) {
      TrieNode &now = nodes[que.front()];
      correct[que.front()] += correct[now.nxt[FAIL]];
      que.pop();
      for(int i = 0; i < 26; i++) {
        if(now.nxt[i] == -1) continue;
        int fail = now.nxt[FAIL];
        while(nodes[fail].nxt[i] == -1) {
          fail = nodes[fail].nxt[FAIL];
        }
        nodes[now.nxt[i]].nxt[FAIL] = nodes[fail].nxt[i];
 
        auto &u = nodes[now.nxt[i]].accept;
        auto &v = nodes[nodes[fail].nxt[i]].accept;
        vector< int > accept;
        set_union(begin(u), end(u), begin(v), end(v), back_inserter(accept));
        u = accept;
        que.emplace(now.nxt[i]);
      }
 
    }
  }
 
  vector< int > match(char c, int &now)
  {
    while(nodes[now].nxt[c - 'a'] == -1) now = nodes[now].nxt[FAIL];
    now = nodes[now].nxt[c - 'a'];
    // count += correct[now];
    return (nodes[now].accept);
  }
};
 
int main()
{
  int N;
  string S[100000], T;
 
  cin >> N;
  Aho_Corasick aho;
 
  for(int i = 0; i < N; i++) {
    cin >> S[i];
    aho.add(S[i]);
  }
  aho.build();
 
  cin >> T;
  vector< int > dp(T.size() + 1, 0);
  dp[0] = 1;
  int curr = 0;
  for(int i = 0; i < T.size(); i++) {
    for(auto &p : aho.match(T[i], curr)) {
      (dp[i + 1] += dp[i + 1 - S[p].size()]) %= mod;
    }
  }
 
  cout << dp.back() << endl;
}