2012 Canadian Computing Competition, Stage 1

Problem S1: Don't pass me the ball!

A CCC soccer game operates under slightly different soccer rules. A goal is only counted if the 4 players, in order, who touched the ball prior to the goal have jersey numbers that are in ascending numeric order with the highest number being the goal-scorer.

Players have jerseys numbered from 1 to 99 (and each jersey number is worn by exactly one player).

Given a jersey number of the goal-scorer, indicate how many possible combinations of players can produce a valid goal.

Input Format

The input will be the positive integer J (J ≤ 99), which is the jersey number of the goal scorer.

Output Format

The output will be one line containing the number of possible scoring combinations that could have J as the goal-scoring jersey number.

Sample Cases

Input

4

Output

1

Input

2

Output

0

Input

90

Output

113564

All Submissions
Best Solutions


Point Value: 3
Time Limit: 2.00s
Memory Limit: 16M
Added: Feb 29, 2012

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, TEXT, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

Comments (Search)

The question can't compile my program. I tried both scanner and console. What do I do? D:
It works fine on Ready to Program and Eclipse, but not this

The Judge is currently having issues when compiling certain languages, it should be fixed soon(hopefully). For now try solving problems in anything other than Haskell, Java, or CPP11.