Problem:
Score : 100 points

Problem Statement

Iroha loves Haiku. Haiku is a short form of Japanese poetry. A Haiku consists of three phrases with 5, 7 and 5 syllables, in this order.

To create a Haiku, Iroha has come up with three different phrases. These phrases have A, B and C syllables, respectively. Determine whether she can construct a Haiku by using each of the phrases once, in some order.

Constraints

1≦A,B,C≦10

Input

The input is given from Standard Input in the following format:

A B C

Output

If it is possible to construct a Haiku by using each of the phrases once, print YES (case-sensitive). Otherwise, print NO.

Sample Input 1

5 5 7

Sample Output 1

YES

Using three phrases of length 5, 5 and 7, it is possible to construct a Haiku.

Sample Input 2

7 7 5

Sample Output 2

NO

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
 
#define REP(i,n) for(i=0;i<n;i++)
 
int iin() {
    int i;
    scanf("%d", &i);
    return i;
}
 
long long llin() {
    long long i;
    scanf("%lld", &i);
    return i; 
}
 
double din() {
    double i;
    scanf("%lf", &i);
    return i;
}
 
char cin() {
    char c;
    scanf("%c", &c);
    return c;
}
 
void stin(char *s) {
    scanf("%s", s);
}
 
void iout(int i) {
    printf("%d\n", i);
}
 
void llout(long long i) {
    printf("%lld\n", i);
}
 
void dout(double i) {
    printf("%lf\n", i);
}
 
void cout(char c) {
    printf("%c\n", c);
}
 
void stout(char *s) {
    printf("%s\n", s);
}
 
int main() {
  	int f = 0, n = 0;
  	int m, i;
  	REP(i, 3) {
    	m = iin();
  		if (m == 5) f++;
  		if (m == 7) n++;
    }
  	(f == 2 && n == 1) ? stout("YES") : stout("NO");
    return 0;
}