Problem:
Score : 700 points

Problem Statement

You are given N points (x_i,y_i) located on a two-dimensional plane.
Consider a subset S of the N points that forms a convex polygon.
Here, we say a set of points S forms a convex polygon when there exists a convex polygon with a positive area that has the same set of vertices as S. All the interior angles of the polygon must be strictly less than 180°.

For example, in the figure above, {A,C,E} and {B,D,E} form convex polygons; {A,C,D,E}, {A,B,C,E}, {A,B,C}, {D,E} and {} do not.

For a given set S, let n be the number of the points among the N points that are inside the convex hull of S (including the boundary and vertices). Then, we will define the score of S as 2^{n-|S|}.

Compute the scores of all possible sets S that form convex polygons, and find the sum of all those scores.

However, since the sum can be extremely large, print the sum modulo 998244353.

Constraints

1≤N≤200

0≤x_i,y_i<10^4 (1≤i≤N)

If i≠j, x_i≠x_j or y_i≠y_j.

x_i and y_i are integers.

Input

The input is given from Standard Input in the following format:

N
x_1 y_1
x_2 y_2
:
x_N y_N

Output

Print the sum of all the scores modulo 998244353.

Sample Input 1

4
0 0
0 1
1 0
1 1

Sample Output 1

5

We have five possible sets as S, four sets that form triangles and one set that forms a square. Each of them has a score of 2^0=1, so the answer is 5.

Sample Input 2

5
0 0
0 1
0 2
0 3
1 1

Sample Output 2

11

We have three "triangles" with a score of 1 each, two "triangles" with a score of 2 each, and one "triangle" with a score of 4. Thus, the answer is 11.

Sample Input 3

1
3141 2718

Sample Output 3

0

There are no possible set as S, so the answer is 0.

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use io::*;
use std::collections::HashSet;
use std::cmp;

fn main() {
    let input = read_string();
    let mut sc = Scanner::new(&input);
    let n: i64 = sc.next();
    let ps: Vec<Vec<i64>> = sc.next_mat(2, n as usize);
    let mut lines: HashSet<(i64,i64,i64)> = HashSet::new();
    let M = 998244353;
    let mut ans = count_m(n, M);
    for i in 0..n as usize {
        for j in i+1..n as usize {
            let mut a = ps[j][1] - ps[i][1];
            let mut b = ps[i][0] - ps[j][0];
            let g = gcd(a,b);
            a /= g;
            b /= g;
            let c = ps[i][0] * ps[j][1] - ps[j][0] * ps[i][1];
            if lines.contains(&(a,b,c)) {
                continue;
            }
            let mut cnt = 0;
            for k in 0..n as usize {
                if ps[k][0] * a + ps[k][1] * b == c {
                    cnt += 1;
                }
            }
            lines.insert((a,b,c));
            ans = (ans + M - count_m(cnt, M)) % M;
        }
    }
    println!("{}",ans);
}

fn count_m(n: i64, M: i64) -> i64 {
    (pow_m(2,n,M) + M - n * (n+1) / 2 - 1) % M
}

fn pow_m(a: i64, mut n: i64, M: i64) -> i64 {
    let mut r = a % M;
    let mut ret = 1;
    while n > 0 {
        if n % 2 == 1 {
            ret = ret * r % M;
            n -= 1;
        } else {
            r = r * r % M;
            n /= 2;
        }
    }
    ret
}

fn gcd(a: i64, b: i64) -> i64 {
    let aa = a.abs();
    let ba = b.abs();
    let mut x = cmp::min(aa,ba);
    let mut y = cmp::max(aa,ba);
    while x > 0 {
        let t = x;
        x = y % x;
        y = t;
    }
    y
}

pub mod io {
    use std;
    use std::str::FromStr;

    pub struct Scanner<'a> {
        iter: std::str::SplitWhitespace<'a>,
    }

    impl<'a> Scanner<'a> {
        pub fn new(s: &'a str) -> Scanner<'a> {
            Scanner {
                iter: s.split_whitespace(),
            }
        }

        pub fn next<T: FromStr>(&mut self) -> T {
            let s = self.iter.next().unwrap();
            if let Ok(v) = s.parse::<T>() {
                v
            } else {
                panic!("Parse error")
            }
        }

        pub fn next_vec_len<T: FromStr>(&mut self) -> Vec<T> {
            let n: usize = self.next();
            self.next_vec(n)
        }

        pub fn next_vec<T: FromStr>(&mut self, n: usize) -> Vec<T> {
            (0..n).map(|_| self.next()).collect()
        }

        pub fn next_mat<T: FromStr>(&mut self, w: usize, h: usize) -> Vec<Vec<T>> {
            (0..h).map(|_| self.next_vec(w)).collect()
        }

        pub fn next_vec_char(&mut self) -> Vec<char> {
            self.next::<String>().chars().collect()
        }

        pub fn next_mat_char(&mut self, n: usize) -> Vec<Vec<char>> {
            (0..n).map(|_| self.next_vec_char()).collect()
        }
    }

    pub fn read_string() -> String {
        use std::io::Read;

        let mut s = String::new();
        std::io::stdin().read_to_string(&mut s).unwrap();
        s
    }

    pub fn read_line() -> String {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).unwrap();
        s.trim_right().to_owned()
    }
}