Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Arpa and an exam about geometry

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputArpa is taking a geometry exam. Here is the last problem of the exam.

You are given three points *a*, *b*, *c*.

Find a point and an angle such that if we rotate the page around the point by the angle, the new position of *a* is the same as the old position of *b*, and the new position of *b* is the same as the old position of *c*.

Arpa is doubting if the problem has a solution or not (i.e. if there exists a point and an angle satisfying the condition). Help Arpa determine if the question has a solution or not.

Input

The only line contains six integers *a*_{x}, *a*_{y}, *b*_{x}, *b*_{y}, *c*_{x}, *c*_{y} (|*a*_{x}|, |*a*_{y}|, |*b*_{x}|, |*b*_{y}|, |*c*_{x}|, |*c*_{y}| ≤ 10^{9}). It's guaranteed that the points are distinct.

Output

Print "Yes" if the problem has a solution, "No" otherwise.

You can print each letter in any case (upper or lower).

Examples

Input

0 1 1 1 1 0

Output

Yes

Input

1 1 0 0 1000 1000

Output

No

Note

In the first sample test, rotate the page around (0.5, 0.5) by .

In the second sample test, you can't find any solution.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/21/2018 12:05:52 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|