#include #define F first #define S second #define mp make_pair #define pii pair // mikty prikoldar #define ll long long #define pb push_back #define sz(a) (int)(a.size()) #define Accepted 0 //everything goes according to the plan #define y1 NOT #define left NEEDED #define right THINGS //countdown BEGAN. 10 , 9 , 8 ... const int Mod = (int)1e9 + 7; const int MX = 1073741822; const ll MXLL = 9223372036854775807; const int Sz = 1110111; // ai dyn dyn dyn dirindai ai dyn dyn dirindai using namespace std; // skr skr skr v chernih naikah inline void Read_rap () { // smoke weed everyday ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0); } int n, x[Sz], y[Sz]; set s; int main() { Read_rap (); cin >> n; for (int i = 1;i <= n;i ++) cin >> x[i] >> y[i]; for (int i = 1;i <= n;i ++) for (int j = i+1;j <= n;j ++) { int v = y[j] - y[i], u = x[j] - x[i]; if (!v && !u) continue; if (u) s.insert ((double(v / u))); else s.insert (-1); } if (sz(s) == 1) cout << "YES"; else cout <<"NO"; return Accepted; } // Coded by Z...