Recently, esports has been recognized as an official sport in Berland, and regular competitions have begun to take place. Riding the wave of popularity, Monocarp also decided to participate in the upcoming competitions (besides, prizes have never hurt anyone). In each of the following (n) days, one competition will be held. Monocarp would like to participate in all of them, but unfortunately, his current skill level (s) is (0). At the same time, the prize money Monocarp can earn in competitions depends on his skill level. Therefore, Monocarp decided that he could sacrifice participating in some competitions to train and increase his skill level on those days. In general, on the (i)-th day, Monocarp can: either participate in the (i)-th competition and earn (a_i + s) units of money, where (s) is his current skill level; or skip the competition to train: Monocarp will earn nothing but will increase his skill level (s) by (1). Help Monocarp calculate his maximum total income and the number of training plans with such income. Two training plans are considered different if there exists a day that is a training day in one plan and a competition day in the other one. The first line contains a single integer (n) ((1 \le n \le 2 \cdot 10^5)) — the number of days when competitions will take place. The second line contains (n) integers (a_1, a_2, \dots, a_n) ((0 \le a_i \le 10^6)) — the base prize money that Monocarp can expect. Print two integers — the maximum total income that Monocarp can achieve with an optimal training plan and the number of such plans. Since the number of plans may be too big, print it modulo (998\,244\,353). In the first example, Monocarp can either participate or skip the competition — in both cases he will get (0) units. In the second example, it is optimal to simply participate in the competition. In the third example, there are two training plans. Monocarp can either train for