Blackjack

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
12

Output
4

Input
20

Output
15

Input
10

Output
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.

分析：牌分别有2，3，4，5，6，7，8，9，10，千斤顶，皇后，国王和王牌，每一种牌有4张，价值在2到10之间的卡相应地赚到2到10分，一个王牌可以赚1或11，国王、王后和杰克获得10分。一个人有两张牌，第一张牌是固定的，价值为10，你的任务是确定有多少种方法可以得到第二张牌，确保两张牌的总和等于n。

代码如下：

#include"stdio.h"
int main()
{
	int n;
	scanf("%d",&n);
	if(n<=10)
	{
		printf("0\n");
	}
	else if(n>21)
	{
		printf("0\n");
	}
	else if(n==21)
	{
		printf("4\n");
	}
	else if(n<20&&n>=11)
	{
		printf("4\n");
	}
	else if(n==20)
	{
		printf("15\n");//其中有一张价值为10的牌是固定的第一张
	}
	return 0;
}