#include <cstdio>

#include <cstring>

#include <cstdlib>

#include <algorithm>

using namespace std;

const int MAXN = ;

const int segma_size = ;

const int MOD = ;

struct Suffix_Automaton

{

    int F[MAXN << ];               //fail

    int ant;                        //sum node

    int last;                       //last point

    int ch[MAXN << ][segma_size];  //side

    int step[MAXN << ];            //len

    void init()

    {

        last = ant = ;

        memset(F,,sizeof(F));

        memset(ch,,sizeof(ch));

        memset(step,,sizeof(step));

        return;

    }

    void ins( int x )

    {

        int t = ++ant, pa = last;

        step[t] = step[last] + ;

        last = t;

        for( ; pa && !ch[pa][x]; pa = F[pa] )

            ch[pa][x] = t;

        if( pa ==  ) F[t] = ;

        else if( step[pa] +  == step[ ch[pa][x] ] )

            F[t] = ch[pa][x];

        else

        {

            int nq = ++ant, q = ch[pa][x];

            memcpy( ch[nq], ch[q], sizeof(ch[nq]) );

            step[nq] = step[pa] + ;

            F[nq] = F[q];

            F[q] = F[t] = nq;

            for( ; pa && ch[pa][x] == q; pa = F[pa] )

                ch[pa][x] = nq;

        }

    }

};

int N;

char str[MAXN + ];

int strL;

Suffix_Automaton SAM;

int r[MAXN << ];

int sum[MAXN << ];

int cnt[MAXN << ];

bool cmp( int a, int b )

{

    return SAM.step[a] < SAM.step[b];

}

void show()

{

    for ( int i = ; i <= SAM.ant; ++i )

    {

        for ( int j = ; j < ; ++j )

        {

            printf( "%d ", SAM.ch[i][j] );

        }

        puts("");

    }

    return;

}

int main()

{

    //freopen( "s.txt", "w", stdout );

    while ( scanf( "%d", &N ) ==  )

    {

        SAM.init();

        strL = ;

        for ( int n = ; n < N; ++n )

        {

            if ( strL )

                str[strL++] = '' + ;

            scanf( "%s", &str[strL] );

            strL += strlen( &str[strL] );

        }

        for ( int i = ; i < strL; ++i )

            SAM.ins( str[i] - '' );

        for ( int i = ; i <= SAM.ant; ++i )

            r[i] = i;

        sort( r + , r +  + SAM.ant, cmp );

        memset( sum, , sizeof(int)*(SAM.ant+) );

        memset( cnt, , sizeof(int)*(SAM.ant+) );

        int ans = ;

        cnt[] = ;

        for ( int i = ; i <= SAM.ant; ++i )

        {

            int u = r[i];

            if ( i >  && !cnt[u] ) continue;

            ans = ( ans + sum[u] ) % MOD;

            for ( int j = ; j < ; ++j )

            {

                if ( u ==  && j ==  ) continue;

                if ( !SAM.ch[u][j] ) continue;

                int v = SAM.ch[u][j];

                sum[v] = ( sum[u] *  + sum[v] + cnt[u] * j ) % MOD;

                cnt[v] += cnt[u];

            }

        }

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

    }

    return ;

}