#include <bits/stdc++.h> 
using namespace std;
#define FOR(i,l,r) for(int i=(l); i<(r); i++)
#define REP(i,n) FOR(i,0,n)
#define endl "\n"
#define debug(x) cout<<x<<endl;
typedef long long ll;
static const int INF = 1e9+7;

bool equal(double a, double b){
    double eps = 1e-4;
    if(fabs(a - b) <= eps) return true;
    else return false;
}

int main(){
    int N;
    cin>>N;
    vector<int> X(N),Y(N);
    REP(i,N){
        cin>>X[i]>>Y[i];
    }

    bool flag = false;

    REP(i,N){
        FOR(j,i+1,N){
            if(X[i] == 0 && X[j] == 0){
                FOR(k,j+1,N){
                    if(X[k] == 0){
                        cout<<"Yes"<<endl;
                        return 0;
                    }
                }
            }
            else{
                double dif = (Y[j] - Y[i]) / (double)(X[j] - X[i]);
                FOR(k,j+1,N){
                    if((dif == (double)(Y[k] - Y[j])/ (double)(X[k] - X[j]))){
                        cout<<"Yes"<<endl;
                        return 0;
                    }
                }
            }
        }
    }
    cout<<"No"<<endl;
}


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define rep(i,b,e) for(int i=b;i<e;i++)
#define per(i,e,b) for(int i=e;i>b;i--)
const int maxn = 5e5+5;

void solve() {
	ll s,p; cin >> s >> p;
	for(ll i=1; i*i <= p; i++) {
		if (p%i==0 && (p/i + p/(p/i)) == s) {
			cout << "Yes\n";
			return;
		}
		if (p%(p/i)==0 && (p/i + p/(p/i)) == s) {
			cout << "Yes\n";
			return;
		}
	}
	cout << "No\n";
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef DEBUG
	freopen("/home/l4wenwen/data/in", "r", stdin);
	//freopen("~/out", "w", stdout);
#endif
	//int t; cin >> t; while(t--)
		solve();
	return 0;
}