Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E1. Twilight and Ancient Scroll (easier version)

time limit per test

1.5 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThis is an easier version of the problem E with smaller 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 \ne 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 \le n \le 1000$$$): 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 more or equal than $$$1$$$. The sum of lengths of words does not exceed $$$20000$$$.

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).

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/29/2021 22:49:52 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|