翻译(15)

题目：Chinese Valentime's Day | JXNUOJ

描述:

Recently, God Liu has been so absorbed in the Pac-Man game that he has even neglected his young fans.So before Chinese valentine's day，in order to have time for him to accompany the girls, while God Liu went to the bathroom, Lao Zhao hid his computer, and told him that computer had been hidden near the date place.But Lao Zhao can't tell him where the computer has been hidden.

Lao Zhao tell God Liu N numbers, the answer is the sum of all the numbers that have appeared in n numbers(mod 9982443553).For example, in 123 there are 1,2,3,12,23,123。

Gao Liu are so excited,he decides to pick up the computer after the date night.But he is too busy,sou he ask you to help him。Do you know the answer?

最近刘神沉迷于玩吃豆人游戏，甚至忽略了他的小粉丝们。为了让他有时间陪女孩，趁刘神去卫生间的时候，老赵把六神的计算机藏了起来，并且告诉他计算机藏在约会地点附近。但是老赵不会告诉他计算机被藏在哪里。

老赵告诉刘神N个数字，答案是所有出现在N个数字中的数字的总和(mod 9982443553)。比如，在123中有1,2,3,12,23,123这些数字。

刘神十分兴奋，他决定在约会夜晚之后找到电脑。但是他太忙了，所以他要你去帮组他。你知道答案吗？

输入：

In the first line there is an positive integer N(1<=N<=1000),which means there are N numbers.

The next N line,each line is contains one number.

The digit sum of all numbers does not exceed 1000000.

第一行是一个正整数N(1<=N<=1000)，即有N个数字。

接下来的N行，每行包括一个数字。

所有数的数字和不超过1000000.

输出：

One integer after mod 99824435539982443553.(An occurrence in a number is defined as the number of substrings, and repeated occurrences are counted only once)

一个整数在以99824435539982443553做模后。（数字作为子字符串出现，重复出现只算一次）