## CCC '22 S1 - Good Fours and Good Fives

View as PDF

Points: 5 (partial)
Time limit: 2.0s
Memory limit: 1G

Problem types
##### Canadian Computing Competition: 2022 Stage 1, Senior #1

Finn loves Fours and Fives. In fact, he loves them so much that he wants to know the number of ways a number can be formed by using a sum of fours and fives, where the order of the fours and fives does not matter. If Finn wants to form the number , there is one way to do this which is . As another example, if Finn wants to form the number , this can be done two ways, which are and . As a final example, Finn can form the number in three ways: , , and .

Your task is to help Finn determine the number of ways that a number can be written as a sum of fours and fives.

#### Input Specification

The input consists of one line containing a number .

The following table shows how the available marks are distributed.

marksNone
marks is a multiple of
marks is a multiple of
marksNone

#### Output Specification

Output the number of unordered sums of fours and fives which form the number . Output if there are no such sums of fours and fives.

#### Sample Input 1

14

#### Output for Sample Input 1

1

#### Explanation of Output for Sample Input 1

This is one of the examples in the problem description.

#### Sample Input 2

40

#### Output for Sample Input 2

3

#### Explanation of Output for Sample Input 2

This is one of the examples in the problem description.

#### Sample Input 3

6

#### Output for Sample Input 3

0

#### Explanation of Output for Sample Input 3

There is no way to use a sum of fours and fives to get .