At a geometry lesson Gerald was given a task: to get vector B out of vector A. Besides, the teacher permitted him to perform the following operations with vector А:

  * Turn the vector by 90 degrees clockwise.
  * Add to the vector a certain vector C.



Operations could be performed in any order any number of times.

Can Gerald cope with the task?

Input

The first line contains integers x1 и y1 — the coordinates of the vector A ( - 108 ≤ x1, y1 ≤ 108). The second and the third line contain in the similar manner vectors B and C (their coordinates are integers; their absolute value does not exceed 108).

Output

Print "YES" (without the quotes) if it is possible to get vector B using the given operations. Otherwise print "NO" (without the quotes).

Examples

Input

0 0
1 1
0 1


Output

YES


Input

0 0
1 1
1 1


Output

YES


Input

0 0
1 1
2 2


Output

NO

import java.util.Scanner;

public class E {
    public static boolean solve(long x, long y, long c, long d) {
        if (x == 0 && y == 0)
            return c == 0 && d == 0;
        if (x == 0)
            return c % y == 0 && d % y == 0;
        if (y == 0)
            return c % x == 0 && d % x == 0;
        if ((c * x + d * y) % (x * x + y * y) != 0)
            return false;
        long a = (c * x + d * y) / (x * x + y * y);
        return (d - a * y) % x == 0;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        long ax = in.nextInt();
        long ay = in.nextInt();
        long bx = in.nextInt();
        long by = in.nextInt();
        long cx = in.nextInt();
        long cy = in.nextInt();
        if (solve(cx, cy, bx - ax, by - ay) || solve(cx, cy, bx - ay, by + ax)
                || solve(cx, cy, bx + ax, by + ay)
                || solve(cx, cy, bx + ay, by - ax))
            System.out.println("YES");
        else
            System.out.println("NO");
    }

}
