atCoder-Collinearity- by Shanto

/*    BISMILLAHIR-RAHMANIR-RAHIM
 ____________________________________
|                                    |
|      SHANTO_SUST_SWE-19__029       |
|      shanto-swe029.github.io       |
|____________________________________|
*/

#include <bits/stdc++.h>
#define r0          return 0
#define endl        "\n"

using namespace std;

int main()
{
    int n;
    std::cin >> n;
    std::vector < pair < int, int > > v;
    std::pair < int, int > p;
    for( int i = 0; i < n; i++ ) {
        int x, y;
        std::cin >> x >> y;
        p.first = x;
        p.second = y;
        v.push_back(p);
    }
    bool gotcha = false;
    for( int i = 0; i < n; i++ ) {
        for( int j = i + 1; j < n; j++ ) {
            for( int k = j + 1; k < n; k++ ) {
                int det = v[i].first * v[j].second + v[j].first * v[k].second + v[k].first * v[i].second;
                det -= v[i].second * v[j].first + v[j].second * v[k].first + v[k].second * v[i].first;
                if( det == 0 ) {
                    gotcha = true;
                    break;
                }
            }
            if( gotcha ) break;
        }
        if( gotcha ) break;
    }
    if( gotcha ) std::cout << "Yes";
    else std::cout << "No";

    r0;
}

//ALHAMDULILLAH