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 (Clang 3.8.0) (judge verdict: Wrong Answer)

#define _CRT_SECURE_NO_WARNINGS

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <inttypes.h>
#include <stdint.h>
#include <string.h>
#include <wchar.h>

#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)
#define ABSS(a, b) (a > b ? a - b : b - a)

char S[100][101];

int main(void) {
	uint32_t S[3];
	uint32_t len5Count = 0;
	uint32_t len7Count = 0;

	scanf("%"PRIu32" %"PRIu32" %"PRIu32, &S[0], &S[1], &S[2]);
	for (uint32_t idx = 0; idx < 3; idx++) {
		if (S[idx] == 5) {
			len5Count++;
		}
		else if (S[idx] == 7) {
			len7Count++;
		}
	}

	printf("%s\n", (len5Count == 2 && len7Count == 1 ? "Yes" : "No"));

	return 0;
}