#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <stack>
#include <assert.h>
using namespace std;int f[111][111];void up(int &x,int y)
{if(x==-1||x>y) x=y;
}int cal(string s1,string s2)
{const int n=(int)s1.size();const int m=(int)s2.size();if(n==0) return m;if(m==0) return n;memset(f,-1,sizeof(f));f[0][0]=0;for(int i=1;i<=m;++i) f[0][i]=i;for(int i=1;i<=n;++i) f[i][0]=i;for(int i=1;i<=n;++i){for(int j=1;j<=m;++j){char c1=s1[i-1];char c2=s2[j-1];up(f[i][j],f[i-1][j]+1);up(f[i][j],f[i][j-1]+1);up(f[i][j],f[i-1][j-1]+(c1!=c2));}}return f[n][m];
}class RepeatString
{
public:int minimalModify(string s){const int n=(int)s.size();int ans=n;for(int i=0;i<=n;++i){ans=min(ans,cal(s.substr(0,i),s.substr(i)));}return ans;}
};

#include <stdio.h>
#include <string.h>
#include <string>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <stack>
#include <assert.h>
using namespace std;const int N=111;
const int mod=1000000007;int C[N][N],p[N];void init()
{C[0][0]=1;for(int i=1;i<N;++i){C[i][0]=C[i][i]=1;for(int j=1;j<i;++j){C[i][j]=C[i-1][j]+C[i-1][j-1];if(C[i][j]>=mod) C[i][j]-=mod;}}p[0]=1;for(int i=1;i<N;++i){p[i]=p[i-1]<<1;if(p[i]>=mod) p[i]-=mod;}
}class IntersectingConvexHull
{
public:int count(vector <int> x, vector <int> y){init();const int n=(int)x.size();int ans=0;for(int i=3;i<=n;++i) for(int j=3;j<=n-i;++j){ans+=(long long)C[n][i]*C[n-i][j]%mod;if(ans>=mod) ans-=mod;}for(int i=0;i<n;++i) for(int j=0;j<n;++j) if(i!=j){int s[2]={0,0};for(int k=0;k<n;++k) if(k!=i&&k!=j){long long d=(long long)(x[j]-x[i])*(y[k]-y[i])-(long long)(x[k]-x[i])*(y[j]-y[i]);if(d>0) ++s[0];else ++s[1];}if(s[0]<2||s[1]<2) continue;int t0=p[s[0]]-1-s[0];int t1=p[s[1]]-1-s[1];ans-=(long long)t0*t1%mod;if(ans<0) ans+=mod;}return ans;}
};int main()
{IntersectingConvexHull p;printf("%d\n",p.count({-2,-1,-1,1,1,2},{1,0,2,0,2,1}));
}