Problem: Mishka is decorating the Christmas tree. He has got three garlands, and all of them will be put on the tree. After that Mishka will switch these garlands on.

When a garland is switched on, it periodically changes its state — sometimes it is lit, sometimes not. Formally, if i-th garland is switched on during x-th second, then it is lit only during seconds x, x + ki, x + 2ki, x + 3ki and so on.

Mishka wants to switch on the garlands in such a way that during each second after switching the garlands on there would be at least one lit garland. Formally, Mishka wants to choose three integers x1, x2 and x3 (not necessarily distinct) so that he will switch on the first garland during x1-th second, the second one — during x2-th second, and the third one — during x3-th second, respectively, and during each second starting from max(x1, x2, x3) at least one garland will be lit.

Help Mishka by telling him if it is possible to do this!

Input

The first line contains three integers k1, k2 and k3 (1 ≤ ki ≤ 1500) — time intervals of the garlands.

Output

If Mishka can choose moments of time to switch on the garlands in such a way that each second after switching the garlands on at least one garland will be lit, print YES.

Otherwise, print NO.

Examples

Input

2 2 3


Output

YES


Input

4 2 3


Output

NO

Note

In the first example Mishka can choose x1 = 1, x2 = 2, x3 = 1. The first garland will be lit during seconds 1, 3, 5, 7, ..., the second — 2, 4, 6, 8, ..., which already cover all the seconds after the 2-nd one. It doesn't even matter what x3 is chosen. Our choice will lead third to be lit during seconds 1, 4, 7, 10, ..., though.

In the second example there is no way to choose such moments of time, there always be some seconds when no garland is lit.

Solution (in JAVA):

Solution:

//app.は全部けす



import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


//流す前にfinalにする
public final class EcRound35CApplication {

	public static void main(String[] args) {


		//実インプット部　appだけけす
		Input input = new Input();
		input = SystemInput();
		String result = run(input);
		System.out.print(result);
		//実インプット部ここまで


	}

	//流す前にstaticにする
	private static void tester(Integer no,Integer KFirst,Integer KSecond , Integer KThird,String answer) {
		Input input = new Input();
		input.setInput(KFirst,KSecond,KThird);
		String result = run(input);

		if(result == answer) {
			System.out.println("No." + no + ":OK");
		}
		else {
			System.out.println("No." + no + ":failed");
			System.out.println("result:" + result);
			System.out.println("answer:" + answer);
		}
	}

	//流す前にstaticにする
	private static Input SystemInput() {
		Input input = new Input();
		Scanner sc = new Scanner(System.in);
		Integer first = sc.nextInt();
		Integer second = sc.nextInt();
		Integer third = sc.nextInt();
		input.setInput(first,second,third);
		sc.close();
		return input;
	}

	//流す前にstaticにする
	private static String run(Input input) {
		String result = "NO";

		//どれが1なら議論の余地もなくYES
		if(input.oneCheck()) {
			return "YES";
		}

		//数的検証
		//超理想的に詰めても、平均1以上ないと無理
		if(input.density() < 1) {
			return "NO";
		}

		//6パターン検証してどっかで引っかかれば良い
		//starter:1秒目に光るやつ
		//follower:次を埋めるやつ
		//matcher:最後に当てはまるか検証するやつ
		//inputを(A,B,Cとして)

		//A,B,C
		result = checker(input.getKFirst(),input.getKSecond(),input.getKThird(),result);
		//A,C,B
		result = checker(input.getKFirst(),input.getKThird(),input.getKSecond(),result);
		//B,A,C
		result = checker(input.getKSecond(),input.getKFirst(),input.getKThird(),result);
		//B,C,A
		result = checker(input.getKSecond(),input.getKThird(),input.getKFirst(),result);
		//C,A,B
		result = checker(input.getKThird(),input.getKFirst(),input.getKSecond(),result);
		//C,B,A
		result = checker(input.getKThird(),input.getKSecond(),input.getKFirst(),result);


		return result;
	}


	private static String checker(Integer starter,Integer follower,Integer matcher,String result) {

		//既にresultがYESになってたら処理を飛ばす
		if(result == "YES") {
			return result;
		}

		//パターン出しのためユークリッド互除法を利用して最小公倍数を出しておく
		Integer LCM = starter*follower/euclidean(starter,follower);

		//遅延秒数管理
		Integer followerDelay;

		//遅延秒数をずらしてどっかでビンゴしないか試す
		for(followerDelay = 0; followerDelay < starter; followerDelay++){
			//最小公倍数+ずれ分足しとけばだいたいパターン網羅できるっしょ的な
			Integer pattarnLength = LCM * 2 + followerDelay;

			//starterとfollowerで光らないやつ数え上げ
			List<Integer> needToMatchList = new ArrayList<Integer>();
			for(Integer pattarn = 1; pattarn <= pattarnLength ; pattarn++) {
				//starterが光るかチェック（starterは1秒目点灯なのでかならず余り1になる）
				if(pattarn % starter == 1) {
					continue;
				}
				//followerが光るかチェック
				//丁度割り切れる場合があるのでfollowerで割った余りを検証に使う
				if(pattarn % follower == (1+followerDelay)%follower) {
					continue;
				}
				//ヒットしなければリストに加える
				needToMatchList.add(pattarn);
			}

			//リストの長さが0ならまずOK
			if(needToMatchList.size() == 0) {
				return "YES";
			}

			//一つだけある場合は、リストにLCM足したやつを加える
			//（パターンをもう一つ分増やす）
			else if(needToMatchList.size() == 1) {
				needToMatchList.add(needToMatchList.get(0)+LCM);
			}
			//2つ以上ある場合は値間が全てmatcherに一致しているかチェック
			if(needToMatchList.size() >= 2) {
				for(Integer k = 0; k < needToMatchList.size() - 1; k++) {
					Integer between = needToMatchList.get(k+1) - needToMatchList.get(k);
					if(between == matcher) {
						result = "YES";
					}
					else {
						result = "NO";
						break;
					}
				}
			}
		}
		return result;
	}

	private static Integer euclidean(Integer a,Integer b) {
		Integer r;

		//大小逆転解消
		if(a<b) {
			Integer tmp;
			tmp = a;
			a = b;
			b = tmp;
		}

		r = a % b;
		if(r == 0) {
			return b;
		}
		else {
			return euclidean(b,r);
		}

	}

	private static Double reciprocal(Integer i) {
		Double reciprocal;
		reciprocal = 1 / i.doubleValue();
		return reciprocal;
	}




	//流す前にstaticにする
	private static class Input{
		private Integer kFirst;
		private Integer kSecond;
		private Integer kThird;

		public void setInput(Integer kFirst,Integer kSecond , Integer kThird) {
			this.kFirst = kFirst;
			this.kSecond = kSecond;
			this.kThird = kThird;

		}

		public Integer getKFirst() {
			return kFirst;
		}

		public void setKFirst(Integer kFirst) {
			this.kFirst = kFirst;
		}

		public Integer getKSecond() {
			return kSecond;
		}

		public void setKSecond(Integer kSecond) {
			this.kSecond = kSecond;
		}

		public Integer getKThird() {
			return kThird;
		}

		public void setKThird(Integer kThird) {
			this.kThird = kThird;
		}

		public boolean oneCheck() {
			if(kFirst == 1 || kSecond == 1 || kThird == 1) {
				return true;
			}
			else {
				return false;
			}
		}
		public Double density() {
			return reciprocal(this.kFirst) + reciprocal(kSecond) + reciprocal(kThird);
		}


	}
}