About Grisha N. ( URAL

Problem

Grisha N. told his two teammates that he was going to solve all given problems at the subregional contest, even if the teammates wouldn’t show up at the competition. The teammates didn’t believe Grisha so he told them the plan how he was going to do this.

During the first hour he wants to solve f problems. If there is still some time left to the end of the first hour, Grisha will simply walk along the hall. Beginning from the second hour Grisha wants to spend exactly 45 minutes on each of the problems left. If the plan is a success, will Grisha be able to solve all 12 given problems for 5 hours?

Input

The only line contains an integer f that is the number of problems Grisha wants to solve during the first hour of the competition (1 ≤ f ≤ 11) .

Output

Output “YES”, if Grisha manages to solve all the given problems alone, and “NO” if he doesn’t.

Example

input	output
7	YES
5	NO

---

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <cmath>

using namespace std;
typedef long long ll;
int main()
{
    int n;
    while(scanf("%d",&n) != EOF)
    {
        int m = 12 - n;
        m *= 45;
        if(m > 240)
            printf("NO
");
        else
            printf("YES
");
    }
    return 0;
}