You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Given $10$ integers, how many different remainders are there when these integers are taken modulo $42$?

Input Format

The input consists of $10$ lines, each containing a positive integer not exceeding $10^9$.

Output Format

An integer representing the number of different remainders.

Sample

39
40
41
42
43
44
82
83
84
85

6