#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n; cin >> n;
    vector<pair<int, int>> z;
    pair<int, int> c;
    for (int i=0; i<n; i++)
    {
        cin >> c.first >> c.second;
        z.push_back(c);
    }
    bool flag = false;
    for (int i1=0; i1<n; i1++)
    {
        for (int i2=i1+1; i2<n; i2++)
        {
            for (int i3=i2+1; i3<n; i3++)
            {
                int p = (z[i1].first - z[i2].first) * (z[i1].second - z[i3].second);
                int q = (z[i1].first - z[i3].first) * (z[i1].second - z[i2].second);
                if (p == q)
                {
                    flag = true;
                    break;
                }
            }
            if (flag) break;
        }
        if (flag) break;
    }
    if (flag) cout << "Yes" << endl;
    else cout << "No" << endl;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	ll t;
	scanf("%lld",&t);
	while(t--){
		ll l,r;
		scanf("%lld %lld",&l,&r);
		ll t = (r-l)-l+1;
		ll res;
		if(t>0) res = (t+1)*t/2;
		else res = 0;
		printf("%lld\n",res);
	}
	return 0;
}
