Algorithm

A. Blackjack
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem Link- https://codeforces.com/problemset/problem/104/A
input
standard input
output
standard output

One rainy gloomy evening when all modules hid in the nearby cafes to drink hot energetic cocktails, the Hexadecimal virus decided to fly over the Mainframe to look for a Great Idea. And she has found one!

Why not make her own Codeforces, with blackjack and other really cool stuff? Many people will surely be willing to visit this splendid shrine of high culture.

In Mainframe a standard pack of 52 cards is used to play blackjack. The pack contains cards of 13 values: 2, 3, 4, 5, 6, 7, 8, 9, 10, jacks, queens, kings and aces. Each value also exists in one of four suits: hearts, diamonds, clubs and spades. Also, each card earns some value in points assigned to it: cards with value from two to ten earn from 2 to 10 points, correspondingly. An ace can either earn 1 or 11, whatever the player wishes. The picture cards (king, queen and jack) earn 10 points. The number of points a card earns does not depend on the suit. The rules of the game are very simple. The player gets two cards, if the sum of points of those cards equals n, then the player wins, otherwise the player loses.

The player has already got the first card, it's the queen of spades. To evaluate chances for victory, you should determine how many ways there are to get the second card so that the sum of points exactly equals n.

Input

The only line contains n (1 ≤ n ≤ 25) — the required sum of points.

Output

Print the numbers of ways to get the second card in the required way if the first card is the queen of spades.

Examples
input
Copy
12
output
Copy
4
input
Copy
20
output
Copy
15
input
Copy
10
output
Copy
0
Note

In the first sample only four two's of different suits can earn the required sum of points.

In the second sample we can use all tens, jacks, queens and kings; overall it's 15 cards, as the queen of spades (as any other card) is only present once in the pack of cards and it's already in use.

In the third sample there is no card, that would add a zero to the current ten points.



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <cstdio>

int main(){
    int n; scanf("%d", &n);
    
    const int queenOfSpades = 10;
    const int upperBound = 25;
    int ways[upperBound + 1] = {0};
    for(int k = queenOfSpades + 1; k <= queenOfSpades + 11; k++){ways[k] = 4;}
    ways[2 * queenOfSpades] = 15;
    printf("%d\n", ways[n]);

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
12

Output

x
–
+
cmd
4
Advertisements

Demonstration

Codeforces Solution-A. Blackjack-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+