Snack Purchase Problem

You are given an integer price representing the cost of a snack. You have an unlimited supply of two types of coins: one worth 5 units and another worth 7 units. Your task is to determine whether it is possible to pay exactly the given price using any combination of these coins.

This can be formulated mathematically as: $$5a + 7b = price$$, where a and b are nonnegative integers. If such a combination exists, output "Yes"; otherwise, output "No".

inputFormat

The input consists of a single line containing one integer price (1 ≤ price ≤ 10⁴).

outputFormat

Output a single line with the answer "Yes" if the snack can be purchased exactly using the available coins, or "No" otherwise.

10

Yes