Language: C++

#ifndef __INTMOD_H__0001__
#define __INTMOD_H__0001__

#include <vector>
#include <iostream>

template <unsigned int Modulus>
class IntMod {
	typedef unsigned long long ULL;
private:
	unsigned int value_m;

	void Copy(const IntMod& other) { value_m = other.value_m; }
	bool Modulus_is_valid() { return Modulus != 0; }
public:
	IntMod() { value_m = 0; }
	IntMod(unsigned int value) { value_m = value % Modulus; }
	IntMod(int value) { 
		if (Modulus >= 0x80000000UL) {
			value_m = value >= 0 ? (unsigned int)value % Modulus : Modulus - (unsigned int)(-value);
		} else {
			int tmp = value % (int)Modulus;
			value_m = tmp >= 0 ? tmp : Modulus - (unsigned int)(-tmp);
		}
	}
	IntMod(const IntMod& other) { Copy(other); }
	IntMod& operator=(const IntMod& other) { Copy(other); return *this; }
	bool operator==(const IntMod& right) const { return value_m == right.value_m; }
	bool operator!=(const IntMod& right) const { return value_m != right.value_m; }
	IntMod& operator++() {
		++value_m; 
		value_m %= Modulus;
		return *this;
	}
	IntMod& operator--() {
		if (value_m == 0) { value_m = Modulus - 1; }
		else { --value_m; }
		return *this;
	}
	IntMod operator-() const {
		if (value_m == 0) return IntMod(0);
		return IntMod(Modulus - value_m);
	}
	IntMod& operator+=(const IntMod& right) {
		ULL sum = (ULL)value_m + right.value_m;
		if (sum >= (ULL)Modulus) { value_m = (unsigned int)(sum - (ULL)Modulus); }
		else { value_m = (unsigned int)sum; }
		return *this;
	}
	IntMod& operator-=(const IntMod& right) {
		(*this) += (-right);
		return *this;
	}
	IntMod operator+(const IntMod& right) const {
		IntMod ret(*this);
		ret += right;
		return ret;
	}
	IntMod operator-(const IntMod& right) const {
		IntMod ret(*this);
		ret -= right;
		return ret;
	}
	IntMod& operator*=(const IntMod& right) {
		ULL tmp = (ULL)value_m * right.value_m;
		value_m = tmp % (ULL)Modulus;
		return *this;
	}	
	IntMod& operator/=(const IntMod& right) {
		(*this) *= (right.Inverse());
		return *this;
	}
	IntMod operator*(const IntMod& right) const {
		IntMod ret(*this);
		ret *= right;
		return ret;
	}
	IntMod operator/(const IntMod& right) const {
		IntMod ret(*this);
		ret /= right;
		return ret;
	}
	/* 素数判定は自分でしろ */
	IntMod Inverse() const {
		return (*this).Pow(Modulus - 2);
	}
	IntMod Pow(unsigned int exp) const {
		unsigned int arr[32];		// TODO
		ULL sum = 1;
		arr[0] = value_m;
		for (int i = 1; i < 32; ++i) {
			arr[i] = ((ULL)arr[i - 1] * arr[i - 1]) % (ULL)Modulus;
		}
		for (int i = 0; i < 32; ++i) {
			if (exp & (0x1 << i)) {
				sum *= arr[i]; sum %= (ULL)Modulus;
			}
		}
		return (unsigned int)sum;
	}
	IntMod Fact() const {
		static std::vector<IntMod> table;
		int factoriand = Get_value();
		if (table.size() > factoriand) {
			return table[factoriand];
		}

		int old_size = table.size();
		table.resize(factoriand + 1);
		for (int i = old_size; i <= factoriand; i++) {
			table[i] = (i == 0 ? 1 : table[i - 1] * i);
		}
		return table[factoriand];
	}
	unsigned int Get_value() const {
		return value_m;
	}
};

#endif

//#include "Union_Find.h"

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>

using namespace std;
#define REP(i,a,n) for(int i = (a); i < (int)(n); ++i)
#define REPM(i,n,a) for(int i = ((n) - 1); i >= (a); --i)
#define EPS 0.0001
#define INF 0x3FFFFFFF
#define INFLL 0x3FFFFFFF3FFFFFFF
#define INFD 1.0e+308
#define FLOAT fixed << setprecision(16)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;

#if 1
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
#endif

typedef IntMod<998244353> MM;

int N;
PP A[200];
bool used[200][200];
MM ans;

bool collinear(int i, int j, int k) {
	return (A[j].second - A[i].second) * (A[k].first - A[i].first)
		== (A[k].second - A[i].second) * (A[j].first - A[i].first);
}

int main() {
	cin >> N;
	REP(i, 0, N) {
		cin >> A[i].first >> A[i].second;
	}

	ans = MM(2).Pow(N) - (N + 1);

	REP(i, 0, N) {
		REP(j, i + 1, N) {
			if (used[i][j]) continue;

			vector<int> S({i, j});
			REP(k, 0, N) {
				if (k == i || k == j) continue;
				if (collinear(i, j, k)) S.push_back(k);
			}
			ans -= MM(2).Pow(S.size()) - (S.size() + 1);
			REP(p, 0, S.size()) {
				REP(q, p + 1, S.size()) {
					used[S[p]][S[q]] = true;
				}
			}
		}
	}
	cout << ans.Get_value() << endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:189:64: error: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'const IntMod<998244353>' is ambiguous
  189 |                         ans -= MM(2).Pow(S.size()) - (S.size() + 1);
      |                                                      ~~~~~~~~~~^~~~
a.cc:18:9: note: candidate: 'IntMod<Modulus>::IntMod(int) [with unsigned int Modulus = 998244353]'
   18 |         IntMod(int value) {
      |         ^~~~~~
a.cc:17:9: note: candidate: 'IntMod<Modulus>::IntMod(unsigned int) [with unsigned int Modulus = 998244353]'
   17 |         IntMod(unsigned int value) { value_m = value % Modulus; }
      |         ^~~~~~
a.cc:59:40: note:   initializing argument 1 of 'IntMod<Modulus> IntMod<Modulus>::operator-(const IntMod<Modulus>&) const [with unsigned int Modulus = 998244353]'
   59 |         IntMod operator-(const IntMod& right) const {
      |                          ~~~~~~~~~~~~~~^~~~~