Distinct Modulo 42 Count

Given 10 integers as input, compute the number of distinct remainders when each integer is divided by 42. In mathematical terms, for an integer \( x \), its remainder modulo 42 is given by \( x \mod 42 \). The task is to output the count of unique values among these remainders.

inputFormat

The input consists of 10 lines. Each line contains a single integer.

outputFormat

Output a single integer representing the number of distinct remainders when the input numbers are divided by 42.

sample

39
40
41
42
43
44
82
83
84
85

6