Problem: This is a harder version of the problem E with larger constraints.

Twilight Sparkle has received a new task from Princess Celestia. This time she asked to decipher the ancient scroll containing important knowledge of pony origin.

To hide the crucial information from evil eyes, pony elders cast a spell on the scroll. That spell adds exactly one letter in any place to each word it is cast on. To make the path to the knowledge more tangled elders chose some of words in the scroll and cast a spell on them.

Twilight Sparkle knows that the elders admired the order in all things so the scroll original scroll contained words in lexicographically non-decreasing order. She is asked to delete one letter from some of the words of the scroll (to undo the spell) to get some version of the original scroll. 

Unfortunately, there may be more than one way to recover the ancient scroll. To not let the important knowledge slip by Twilight has to look through all variants of the original scroll and find the required one. To estimate the maximum time Twilight may spend on the work she needs to know the number of variants she has to look through. She asks you to find that number! Since that number can be very big, Twilight asks you to find it modulo 10^9+7.

It may occur that princess Celestia has sent a wrong scroll so the answer may not exist.

A string a is lexicographically smaller than a string b if and only if one of the following holds:

  * a is a prefix of b, but a ≠ b;
  * in the first position where a and b differ, the string a has a letter that appears earlier in the alphabet than the corresponding letter in b.

Input

The first line contains a single integer n (1 ≤ n ≤ 10^5): the number of words in the scroll.

The i-th of the next n lines contains a string consisting of lowercase English letters: the i-th word in the scroll. The length of each word is at least one. The sum of lengths of words does not exceed 10^6.

Output

Print one integer: the number of ways to get a version of the original from the scroll modulo 10^9+7.

Examples

Input


3
abcd
zaza
ataka


Output


4


Input


4
dfs
bfs
sms
mms


Output


8


Input


3
abc
bcd
a


Output


0


Input


6
lapochka
kartyshka
bigbabytape
morgenshtern
ssshhhiiittt
queen


Output


2028

Note

Notice that the elders could have written an empty word (but they surely cast a spell on it so it holds a length 1 now).

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, N = 1000100;
int n;
struct Cmp {
  int m;
  int d[N], ds[N], dt[N];
  int posd[N], posds[N], posdt[N];
  void work(int *_d, int n, int *pos_d) {
    for (int i = 0; i < n; ++i) pos_d[i] = n;
    for (int i = n - 1; i >= 0; --i) {
      if (i + 1 < n) pos_d[i] = pos_d[i + 1];
      if (_d[i] != 0) pos_d[i] = i;
    }
  }
  void init(string &s, string &t) {
    m = s.size();
    for (int i = 0; i < m; ++i) {
      d[i] = s[i] - t[i];
      if (i + 1 < m) {
        ds[i] = s[i + 1] - t[i];
        dt[i] = s[i] - t[i + 1];
      }
    }
    work(d, m, posd);
    work(ds, m - 1, posds);
    work(dt, m - 1, posdt);
  }
  int sign(int x) { return x < 0 ? -1 : 1; }
  int check(int i, int j) {
    int x = min(i, j);
    if (posd[0] < x) return sign(d[posd[0]]);
    if (i == j) {
      if (i + 1 == m) return 0;
      if (posd[i + 1] == m) return 0;
      return sign(d[posd[i + 1]]);
    }
    if (i < j) {
      if (posds[i] < j) return sign(ds[posds[i]]);
      if (j + 1 == m) return 0;
      if (posd[j + 1] == m) return 0;
      return sign(d[posd[j + 1]]);
    } else {
      if (posdt[j] < i) return sign(dt[posdt[j]]);
      if (i + 1 == m) return 0;
      if (posd[i + 1] == m) return 0;
      return sign(d[posd[i + 1]]);
    }
  }
} cmp[4];
vector<pair<int, int> > chk;
bool CMP(const pair<int, int> &aa, const pair<int, int> &bb) {
  int x = cmp[aa.second * 2 + bb.second].check(aa.first, bb.first);
  if (x != 0) return x < 0;
  return aa.second < bb.second;
}
int main() {
  cin >> n;
  string s = "#", t;
  vector<int> f = {1};
  for (int i = 0; i < n; ++i) {
    cin >> t;
    t.push_back('#');
    vector<int> g(t.size());
    while (s.size() < t.size()) s.push_back('#'), f.push_back(0);
    while (s.size() > t.size()) t.push_back('#'), g.push_back(0);
    cmp[0].init(s, s);
    cmp[1].init(s, t);
    cmp[2].init(t, s);
    cmp[3].init(t, t);
    chk.clear();
    int m = s.size();
    for (int i = 0; i < m; ++i) {
      chk.push_back(make_pair(i, 0));
      chk.push_back(make_pair(i, 1));
    }
    sort(chk.begin(), chk.end(), CMP);
    int sum = 0;
    for (int i = 0; i < chk.size(); ++i) {
      if (chk[i].second == 0)
        sum = (sum + f[chk[i].first]) % mod;
      else
        g[chk[i].first] = (g[chk[i].first] + sum) % mod;
    }
    swap(s, t), swap(f, g);
    while (s.size() >= 2 && s[s.size() - 2] == '#') {
      s.pop_back();
      f.pop_back();
    }
  }
  int ans = 0;
  for (int i = 0; i < f.size(); ++i) ans = (ans + f[i]) % mod;
  cout << (ans + mod) % mod;
  return 0;
}