Contest Duration: - (local time) (100 minutes) Back to Home
A - Edge Checker 2 /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 制約

• 1 \leq a \lt b \leq 15
• a,b は整数

### 入力

a b


### 出力

a 番の点と b 番の点が線で直接結ばれているなら Yes、結ばれていないなら No を出力せよ。

### 入力例 1

1 2


### 出力例 1

Yes


### 入力例 2

2 8


### 出力例 2

No


### 入力例 3

14 15


### 出力例 3

No


Score : 100 points

### Problem Statement

Determine if there is a segment that directly connects the points numbered a and b in the figure below.

### Constraints

• 1 \leq a \lt b \leq 15
• a and b are integers.

### Input

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

a b


### Output

Print Yes if there is a segment that directly connects the points numbered a and b; print No otherwise.

### Sample Input 1

1 2


### Sample Output 1

Yes


In the figure in the Problem Statement, there is a segment that directly connects the points numbered 1 and 2, so Yes should be printed.

### Sample Input 2

2 8


### Sample Output 2

No


In the figure in the Problem Statement, there is no segment that directly connects the points numbered 2 and 8, so No should be printed.

### Sample Input 3

14 15


### Sample Output 3

No