#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<unordered_map>
#include<map>
#include<set>
#include<unordered_set>
#include<algorithm>
#include<list>
#include<bitset>
#include<utility>
#include<climits>
#include<deque>
#include<math.h>
#include<stdio.h>
#define INF  (int)1e9
#define MOD 1000000007ll
#define all(x) x.begin(), x.end()
#define sortall(x) sort(all(x))
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define ppb pop_back
#define uset unordered_set
#define umap unordered_map
using namespace std;
bool possible(pii a,pii b,pii c){
	int x1=a.first, y1=a.second;
	int x2=b.first, y2=b.second;
	int x3=c.first, y3=c.second;
	if ((y3 - y2) * (x2 - x1) ==  
        (y2 - y1) * (x3 - x2)) 
        return true; 
    else
	return false; 
}
void solve(){
		int n;
		cin>>n;
		vector<pii>a;
		unordered_map<int,unordered_set<int> > mp;
	for(int i=0,x,y;i<n;i++){
		cin>>x>>y;
		if(mp[x].find(y)==mp[x].end()){
			a.push_back({x,y});
			mp[x].insert(y);
		}
		
	}
	for(int i=0;i<a.size();i++){
		for(int j=i+1;j<a.size();j++){
			for(int k=j+1;k<a.size();k++){
				if(possible(a[i],a[j],a[k])){
					cout<<"Yes\n";
				return ;
				}
			}
		}
	}	
		cout<<"No\n";
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t=1;
	//	cin>>t;
	while(t--){
	solve();
	}
}

#include<bits/stdc++.h>
using namespace std;
#define int long long
int T;
int l,r,ans;
signed main()
{
	cin>>T;
	while(T--)
	{
		cin>>l>>r;
		if(2*l>r)
		{
			cout<<0<<endl;
			continue;
		}
		ans=(r-2*l+1);
		ans=((ans+1)*(ans))/2;
		cout<<ans<<endl;
	}
	return 0;
}