Modulo

Problem code: NSIT13

Given two integers 'A' and 'B', A MOD B is the remainder of the operation A / B.

For example,
7 MOD 3 = 1
14 MOD 3 = 2
27 MOD 3 = 0
38 MOD 3 = 2

Your program should accept 10 non-negative integers as input and output the number of distinct non-negative integers in the input, if they are considered MOD 42.

Input

The input has 10 test cases. Each Test Case contains 10 non-negative integers, each smaller than 1000, one per line.

Output

Output the number of distinct values when considered MOD 42, one per line for each test case.

Example


Input:
39
40
41
42
43
44
82
83
84
85
... 9 more cases

Output:
6
... 9 more answers
Author: admin
Date Added: 1-10-2009
Time Limit: 3 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC


Comments

suggest the special cases for

adam @ 10 Oct 2009 02:00 PM

suggest the special cases for this problem pls .

@admin i have solved this

Geniusguy @ 2 Jan 2010 08:55 PM

@admin

i have solved this problem. . . .i ws solving it jst for practicing. . .

nw hw cn i check whthr my sol is correct or not  ? ? ? ? ?

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

CodeChef is a global programming communityCodeChef hosts online programming competitions