Dima and Friends

题意翻译

给你$n$个数，设其和等于$s$，问$i$在闭区间$[1,5]$中有多少取值满足： $(tot+i)mod$ $n!=1$

题目描述

Dima and his friends have been playing hide and seek at Dima's place all night. As a result, Dima's place got messy. In the morning they decided that they need to clean the place. To decide who exactly would clean the apartment, the friends want to play a counting-out game. First, all the guys stand in a circle, and then each of them shows some number of fingers on one hand (one to five), and then the boys count in a circle, starting from Dima, the number of people, respective to the total number of fingers shown. The person on who the countdown stops will clean the apartment. For example, if Dima and one of his friends played hide and seek, and $ 7 $ fingers were shown during the counting-out, then Dima would clean the place. If there were $ 2 $ or say, $ 8 $ fingers shown, then his friend would clean the place. Dima knows how many fingers each of his friends will show during the counting-out. Now he is interested in the number of ways to show some number of fingers on one hand (one to five), so that he did not have to clean the place. Help Dima.

输入输出格式

输入格式

The first line contains integer $ n $ $ (1<=n<=100) $ — the number of Dima's friends. Dima himself isn't considered to be his own friend. The second line contains $ n $ positive integers, not exceeding $ 5 $ , representing, how many fingers the Dima's friends will show. The numbers in the lines are separated by a single space.

输出格式

In a single line print the answer to the problem.

输入输出样例

输入样例 #1

1
1

输出样例 #1

3

输入样例 #2

1
2

输出样例 #2

2

输入样例 #3

2
3 5

输出样例 #3

3

说明

In the first sample Dima can show $ 1 $ , $ 3 $ or $ 5 $ fingers. If Dima shows $ 3 $ fingers, then the counting-out will go like that: Dima, his friend, Dima, his friend. In the second sample Dima can show $ 2 $ or $ 4 $ fingers.