시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
2 초 1024 MB 6 5 5 83.333%

## 문제

Computing using integers is a dream for every programmer. That is, you do not have to deal with floating point numbers, estimated errors, and etc. We do not even need any floating point units in our computers for divisions!

Your company claimed there is a brand new computational model that solves integer problems efficiently. As a software engineer in this Integer Computing Processors Company (ICPC), you are going to write a validator that checks the following:

Given a list of positive integers A[0], . . . , A[n − 1]. Suppose you pick three different elements arbitrarily of this list, A[i], A[j], A[k] with i, j, k being mutually different. Is it true that (A[i]−A[j])/A[k] is always an integer?

## 입력

The first line of the input contains one integer n indicating the number of positive integers in the list. The second line of the input contains n positive integers A[0], . . . , A[n − 1] separated by blanks.

## 출력

If (A[i]−A[j])/A[k] is always an integer, then output yes. Otherwise output no.

## 제한

• 3 ≤ n ≤ 50
• 1 ≤ A[0] ≤ A[1] ≤ · · · ≤ A[n − 1] ≤ 100

## 예제 입력 1

5
1 1 1 1 4


## 예제 출력 1

yes


## 예제 입력 2

5
1 2 4 8 16


## 예제 출력 2

no