#include<bits/stdc++.h>

using namespace std;

int main()

{

    ios::sync_with_stdio();

    int x1,x2,y1,y2,x,y;

    cin >> x1 >> y1 >> x2 >> y2 >> x >> y;

    int xx = abs(x1-x2),yy = abs(y1-y2);

    if(xx%x || yy%y)

    {

        cout << "NO" << endl;

        return ;

    }

    if(xx/x% == yy/y%)    cout << "YES" << endl;

    else    cout << "NO" << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,a[];

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    for(int i = ;i <= n;i++)   cin >> a[i];

    sort(a+,a++n);

    int num = ,cnt = ;

    if(a[] != a[])    num++;

    if(a[] != a[])    num++;

    if(num == )

    {

        for(int i = ;i <= n;i++)

        {

            if(a[i] == a[])    cnt++;

        }

        cout << (long long)cnt*(cnt-)*(cnt-)/ << endl;

    }

    else if(num ==  && a[] != a[])

    {

        for(int i = ;i <= n;i++)

        {

            if(a[i] == a[])    cnt++;

        }

        cout << (long long)cnt*(cnt-)/ << endl;

    }

    else

    {

        for(int i = ;i <= n;i++)

        {

            if(a[i] == a[])    cnt++;

        }

        cout << cnt << endl;

    }

    return ;

}

#include<bits/stdc++.h>

using namespace std;

long long n,s;

bool ok(long long x)

{

    long long t = x;

    while(t)

    {

        x -= t%;

        t /= ;

    }

    if(x >= s)  return ;

    return ;

}

int main()

{

    ios::sync_with_stdio();

    cin >> n >> s;

    long long l = ,r = n+;

    while(l < r)

    {

        long long mid = (l+r)/;

        if(ok(mid)) r = mid;

        else    l = mid+;

    }

    cout << n-l+ << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,a[],l[],r[];

long long ans = ;

void f()

{

    for(int i = ;i <= n;i++)

    {

        l[i] = i-;

        while(l[i] >=  && a[i] > a[l[i]])  l[i] = l[l[i]];

    }

    for(int i = n;i >= ;i--)

    {

        r[i] = i+;

        while(r[i] <= n && a[i] >= a[r[i]]) r[i] = r[r[i]];

    }

    for(int i = ;i <= n;i++)

        ans += (long long)(r[i]-i)*(i-l[i])*a[i];

}

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    for(int i = ;i <= n;i++)   cin >> a[i];

    f();

    for(int i = ;i <= n;i++)   a[i] = -a[i];

    f();

    cout << ans << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,tr[][] = {},cnt[],sz = ;

void add(int x,int v)

{

    int now = ;

    for(int i = ;i >= ;i--)

    {

        int t = bool((<<i)&x);

        if(!tr[now][t]) tr[now][t] = ++sz;

        now = tr[now][t];

        cnt[now] += v;

    }

}

int getsum(int x,int y)

{

    int now = ,ans = ;

    for(int i = ;i >= ;i--)

    {

        int xt = bool((<<i)&x),yt = bool((<<i)&y);

        if(!yt && !tr[now][xt]) break;

        if(!yt) now = tr[now][xt];

        else

        {

            if(tr[now][xt])  ans += cnt[tr[now][xt]];

            if(!tr[now][!xt])   break;

            now = tr[now][!xt];

        }

    }

    return ans;

}

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    while(n--)

    {

        int x,y,z;

        cin >> x >> y;

        if(x == )  add(y,);

        else if(x == ) add(y,-);

        else

        {

            cin >> z;

            cout << getsum(y,z) << endl;

        }

    }

    return ;

}