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 C {
    static class Line{
        long a,b,c;
        public Line(int a,int b,int c){
            this.a=a;
            this.b=b;
            this.c=c;
        }
        public boolean intersect(Line l){
            if(a==0&&b==0&&c!=0||l.a==0&&l.b==0&&l.c!=0) return false;
            long det=l.b*a-l.a*b;
            if(det==0) {
                if(c==l.c) return true;
                return false;
            }
            if((l.b*c-l.c*b)%det!=0) return false;
            if((l.c*a-l.a*c)%det!=0) return false;
            return true;
        }
    }
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int x1=sc.nextInt();
        int y1=sc.nextInt();
        int xf=sc.nextInt();
        int yf=sc.nextInt();
        if(xf==x1&&yf==y1){
            System.out.println("YES");
            return;
        }
        int xc=sc.nextInt();
        int yc=sc.nextInt();
        Line l1=new Line(xc,yc,yf+y1);
        Line l2=new Line(-yc,xc,xf+x1);
        if(l1.intersect(l2)){
            System.out.println("YES");
            return;
        }
        l1=new Line(xc,yc,yf-y1);
        l2=new Line(-yc,xc,xf-x1);
        if(l1.intersect(l2)){
            System.out.println("YES");
            return;
        }
        l1=new Line(xc,yc,yf-x1);
        l2=new Line(-yc,xc,xf+y1);
        if(l1.intersect(l2)){
            System.out.println("YES");
            return;
        }
        l1=new Line(xc,yc,yf+x1);
        l2=new Line(-yc,xc,xf-y1);
        if(l1.intersect(l2)){
            System.out.println("YES");
            return;
        }
        System.out.println("NO");
        
    }
}
