/*
   ⠀⠀⠀⢀⣠⣤⣶⣶⣶⣶⣶⣦⣄⡀
 ⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄
⠀⠀⠀⣰⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⡀
⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡀
⠀⣾⣿⣿⣿⣿⣿⣿⡿⠿⠟⠛⠹⣿⣿⣿⡿⣿⣻⣿⡇
⠀⠘⠿⡛⡿⠋⠁⠀⠀⠀⠀⠀⢀⣻⡿⣿⡿⢿⣿⣿⣷
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢿⠿⡿⡑⠟⣿⢟⢋
⠀⠀⠀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⢹⣁⣇⠆
⠀⠀⠀⢢⣄⣀⡠⠀⣤⣤⡤⣶⡤⠂⠀⠀⢻⣿⠉⢖⠄
⠀⠀⠀⠀⠺⢿⡹⠂⠉⠉⠙⠃⠀⠀⠀⠀⢸⣿⣆⠃⠁
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡀⠀⠀⠀⠀⢀⣿⣿⣧⣶⡇
⠀⠀⠀⠀⠀⠂⡄⠀⢠⣄⣂⡀⡀⠀⠀⣿⣿⣿⣿⠿⣷
⠀⠀⠀⠀⠀⠀⢿⣿⠭⠿⠛⡻⣿⣄⢰⣿⣿⣿⠛⠀⡇⢻⣿⣶⣤
⠀⠀⠀⠀⠀⠀⠈⢿⠲⢶⠟⠀⢿⣿⣶⣿⡿⠛⠀⠀⠀⢀⣿⣿⣿
⠀⠀⠀⠀⠀⠀⠀⠈⢷⣦⣦⣼⣿⣿⣿⠟⠁⠀⠀⢀⣴⠿⢻⣿⣿
⡄⠀⠀⠀⢀⠤⠂⠀⠌⠉⣿⣿⣯⠋⠁⠀⠀⣠⣶⢿⡹⠃⣸⣿⣿
⣿⣀⣴⣾⠏⠀⠀⠀⣠⣴⠿⡏⠁⡄⠤⢶⠋⠋⡀⠀⣠⣾⠟⠙⠻
⣿⣿⣿⡟⠀⠀⠀⠊⠋⠉⠂⠁⠀⠀⠀⠀⠓⠮⡣⠿⠛.
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector <vll> vvll;
typedef pair <ll, ll> pll;
typedef vector <pll> vpll;
typedef vector<bool> vb;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define len(a) a.size()
#define newl '\n'
#define gcd __gcd
#define forl(i,k,n) for(ll i=k;i<n;i++)
#define fore(i,k,n) for(ll i=k;i<=n;i++)
#define revg(i,k,n) for(ll i=k;i>n;i--)
#define reve(i,k,n) for(ll i=k;i>=n;i--)
#define MOD 1000000007 //10^9 + 7
#define all(x) x.begin(),x.end()
#define len(a) a.size()
#define flush fflush(stdout)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

ll INF = 1000000000000000005LL;

// C++ template to print container elements
template <typename T, typename S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
    os << '('<< v.first <<' '<< v.second<<')';
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const map<T, S>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const unordered_map<T, S>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}

//templated functions to print vector and for doing something like this print(a,b,c...)
template<typename T>
void print(T var1)
{   cout<<var1<<'\n';}
template<typename T,typename... Types>
void print(T var1,Types...var2)
{   cout<<var1<<' ';print(var2...); }

template<typename T>
void read(T &x)
{   cin>>x;}
template<typename T,typename...Types>
void read(T &var1,Types&... var2)
{   cin>>var1;read(var2...);}
template<typename T>
void read(vector<T> &var1)
{   for(auto &i:var1)read(i);}

template<typename T>
T Max(T x)
{   return x; }
template<typename T,typename... Types>
T Max(T var1,Types...var2)
{   return var1>=Max(var2...)?var1:Max(var2...); }
template<typename T>
T Min(T x)
{   return x; }
template<typename T,typename... Types>
T Min(T var1,Types...var2)
{   return var1<=Min(var2...)?var1:Min(var2...); }

ll N = 1e5, LOGN = 25;

void solve() {
    ll n,s,t;
    read(n,s,t);
    if (s+t == 2*n)print(1);
    else if (s+t == n) print(Max(s,t) + 1);
    else{
        ll d = s+t -n;
        s -= d;
        t -= d;
        print(Max(s,t,d) + 1);
    }
}

int main()
{
    fastio;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("error.txt", "w", stderr);
    freopen("output.txt", "w", stdout);
#endif

    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
    return 0;
}


/*
   ⠀⠀⠀⢀⣠⣤⣶⣶⣶⣶⣶⣦⣄⡀
 ⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄
⠀⠀⠀⣰⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⡀
⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡀
⠀⣾⣿⣿⣿⣿⣿⣿⡿⠿⠟⠛⠹⣿⣿⣿⡿⣿⣻⣿⡇
⠀⠘⠿⡛⡿⠋⠁⠀⠀⠀⠀⠀⢀⣻⡿⣿⡿⢿⣿⣿⣷
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢿⠿⡿⡑⠟⣿⢟⢋
⠀⠀⠀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⢹⣁⣇⠆
⠀⠀⠀⢢⣄⣀⡠⠀⣤⣤⡤⣶⡤⠂⠀⠀⢻⣿⠉⢖⠄
⠀⠀⠀⠀⠺⢿⡹⠂⠉⠉⠙⠃⠀⠀⠀⠀⢸⣿⣆⠃⠁
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡀⠀⠀⠀⠀⢀⣿⣿⣧⣶⡇
⠀⠀⠀⠀⠀⠂⡄⠀⢠⣄⣂⡀⡀⠀⠀⣿⣿⣿⣿⠿⣷
⠀⠀⠀⠀⠀⠀⢿⣿⠭⠿⠛⡻⣿⣄⢰⣿⣿⣿⠛⠀⡇⢻⣿⣶⣤
⠀⠀⠀⠀⠀⠀⠈⢿⠲⢶⠟⠀⢿⣿⣶⣿⡿⠛⠀⠀⠀⢀⣿⣿⣿
⠀⠀⠀⠀⠀⠀⠀⠈⢷⣦⣦⣼⣿⣿⣿⠟⠁⠀⠀⢀⣴⠿⢻⣿⣿
⡄⠀⠀⠀⢀⠤⠂⠀⠌⠉⣿⣿⣯⠋⠁⠀⠀⣠⣶⢿⡹⠃⣸⣿⣿
⣿⣀⣴⣾⠏⠀⠀⠀⣠⣴⠿⡏⠁⡄⠤⢶⠋⠋⡀⠀⣠⣾⠟⠙⠻
⣿⣿⣿⡟⠀⠀⠀⠊⠋⠉⠂⠁⠀⠀⠀⠀⠓⠮⡣⠿⠛.
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector <vll> vvll;
typedef pair <ll, ll> pll;
typedef vector <pll> vpll;
typedef vector<bool> vb;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define len(a) a.size()
#define newl '\n'
#define gcd __gcd
#define forl(i,k,n) for(ll i=k;i<n;i++)
#define fore(i,k,n) for(ll i=k;i<=n;i++)
#define revg(i,k,n) for(ll i=k;i>n;i--)
#define reve(i,k,n) for(ll i=k;i>=n;i--)
#define MOD 1000000007 //10^9 + 7
#define all(x) x.begin(),x.end()
#define len(a) a.size()
#define flush fflush(stdout)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

ll INF = 1000000000000000005LL;

// C++ template to print container elements
template <typename T, typename S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
    os << '('<< v.first <<' '<< v.second<<')';
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const map<T, S>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const unordered_map<T, S>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}

//templated functions to print vector and for doing something like this print(a,b,c...)
template<typename T>
void print(T var1)
{   cout<<var1<<'\n';}
template<typename T,typename... Types>
void print(T var1,Types...var2)
{   cout<<var1<<' ';print(var2...); }

template<typename T>
void read(T &x)
{   cin>>x;}
template<typename T,typename...Types>
void read(T &var1,Types&... var2)
{   cin>>var1;read(var2...);}
template<typename T>
void read(vector<T> &var1)
{   for(auto &i:var1)read(i);}

template<typename T>
T Max(T x)
{   return x; }
template<typename T,typename... Types>
T Max(T var1,Types...var2)
{   return var1>=Max(var2...)?var1:Max(var2...); }
template<typename T>
T Min(T x)
{   return x; }
template<typename T,typename... Types>
T Min(T var1,Types...var2)
{   return var1<=Min(var2...)?var1:Min(var2...); }

ll N = 1e5, LOGN = 25;

void solve() {
    ll n,s,t;
    read(n,s,t);
    if (s+t == 2*n)print(1);
    else if (s+t == n) print(max(s,t) + 1);
    else{
        ll d = abs(s-t);
        s -= d;
        t -= d;
        print(max(s,t) + 1);
    }
}

int main()
{
    fastio;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("error.txt", "w", stderr);
    freopen("output.txt", "w", stdout);
#endif

    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
    return 0;
}


/*
   ⠀⠀⠀⢀⣠⣤⣶⣶⣶⣶⣶⣦⣄⡀
 ⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣄
⠀⠀⠀⣰⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⡀
⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡀
⠀⣾⣿⣿⣿⣿⣿⣿⡿⠿⠟⠛⠹⣿⣿⣿⡿⣿⣻⣿⡇
⠀⠘⠿⡛⡿⠋⠁⠀⠀⠀⠀⠀⢀⣻⡿⣿⡿⢿⣿⣿⣷
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢿⠿⡿⡑⠟⣿⢟⢋
⠀⠀⠀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠠⢹⣁⣇⠆
⠀⠀⠀⢢⣄⣀⡠⠀⣤⣤⡤⣶⡤⠂⠀⠀⢻⣿⠉⢖⠄
⠀⠀⠀⠀⠺⢿⡹⠂⠉⠉⠙⠃⠀⠀⠀⠀⢸⣿⣆⠃⠁
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡀⠀⠀⠀⠀⢀⣿⣿⣧⣶⡇
⠀⠀⠀⠀⠀⠂⡄⠀⢠⣄⣂⡀⡀⠀⠀⣿⣿⣿⣿⠿⣷
⠀⠀⠀⠀⠀⠀⢿⣿⠭⠿⠛⡻⣿⣄⢰⣿⣿⣿⠛⠀⡇⢻⣿⣶⣤
⠀⠀⠀⠀⠀⠀⠈⢿⠲⢶⠟⠀⢿⣿⣶⣿⡿⠛⠀⠀⠀⢀⣿⣿⣿
⠀⠀⠀⠀⠀⠀⠀⠈⢷⣦⣦⣼⣿⣿⣿⠟⠁⠀⠀⢀⣴⠿⢻⣿⣿
⡄⠀⠀⠀⢀⠤⠂⠀⠌⠉⣿⣿⣯⠋⠁⠀⠀⣠⣶⢿⡹⠃⣸⣿⣿
⣿⣀⣴⣾⠏⠀⠀⠀⣠⣴⠿⡏⠁⡄⠤⢶⠋⠋⡀⠀⣠⣾⠟⠙⠻
⣿⣿⣿⡟⠀⠀⠀⠊⠋⠉⠂⠁⠀⠀⠀⠀⠓⠮⡣⠿⠛.
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector <vll> vvll;
typedef pair <ll, ll> pll;
typedef vector <pll> vpll;
typedef vector<bool> vb;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define len(a) a.size()
#define newl '\n'
#define gcd __gcd
#define forl(i,k,n) for(ll i=k;i<n;i++)
#define fore(i,k,n) for(ll i=k;i<=n;i++)
#define revg(i,k,n) for(ll i=k;i>n;i--)
#define reve(i,k,n) for(ll i=k;i>=n;i--)
#define MOD 1000000007 //10^9 + 7
#define all(x) x.begin(),x.end()
#define len(a) a.size()
#define flush fflush(stdout)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);

ll INF = 1000000000000000005LL;

// C++ template to print container elements
template <typename T, typename S>
ostream& operator<<(ostream& os, const pair<T, S>& v) {
    os << '('<< v.first <<' '<< v.second<<')';
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const map<T, S>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}
template <typename T, typename S>
ostream& operator<<(ostream& os, const unordered_map<T, S>& v) {
    int cnt=0;
    for (auto it : v)
    {    cnt != v.size()-1? os << it << ' ':os << it; cnt++;}
    return os;
}

//templated functions to print vector and for doing something like this print(a,b,c...)
template<typename T>
void print(T var1)
{   cout<<var1<<'\n';}
template<typename T,typename... Types>
void print(T var1,Types...var2)
{   cout<<var1<<' ';print(var2...); }

template<typename T>
void read(T &x)
{   cin>>x;}
template<typename T,typename...Types>
void read(T &var1,Types&... var2)
{   cin>>var1;read(var2...);}
template<typename T>
void read(vector<T> &var1)
{   for(auto &i:var1)read(i);}

template<typename T>
T Max(T x)
{   return x; }
template<typename T,typename... Types>
T Max(T var1,Types...var2)
{   return var1>=Max(var2...)?var1:Max(var2...); }
template<typename T>
T Min(T x)
{   return x; }
template<typename T,typename... Types>
T Min(T var1,Types...var2)
{   return var1<=Min(var2...)?var1:Min(var2...); }

ll N = 1e5, LOGN = 25;

void solve() {
    ll n,s,t;
    read(n,s,t);
    if (s+t == 2*n)print(1);
    else if (s+t == n) print(Min(s,t) + 1);
    else{
        ll d = s+t -n;
        s -= d;
        t -= d;
        print(Min(s,t,d) + 1);
    }
}

int main()
{
    fastio;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("error.txt", "w", stderr);
    freopen("output.txt", "w", stdout);
#endif

    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
    return 0;
}


# include <bits/stdc++.h>
using namespace std;
int   main(void)
{
	int n;
	cin>>n;
	while(n--)
	{
		long long a,b,c;
		cin>>a>>b>>c;
		if(b+c == a)
		{
			if(b==c)
			cout<<a<<endl;
			else if(b<c)
			{
				cout<<c+1<<endl;
			}
			else
			{
				cout<<b+1<<endl;
			}
		}
		else
		{
			if(c==a && b==a)
			cout<<1<<endl;
			else if(b==c)
			{
				cout<<a-b+1<<endl;
			}
			else
			{
				int t = min(b,c);
				cout<<t+1<<endl;
			}
		}
	}
	return 0;
}


# include <bits/stdc++.h>
using namespace std;
int   main(void)
{
	int n;
	cin>>n;
	while(n--)
	{
		long long a,b,c;
		cin>>a>>b>>c;
		if(b+c == a)
		{
			if(b==c)
			cout<<b+1<<endl;
			else if(b<c)
			{
				cout<<c+1<<endl;
			}
			else
			{
				cout<<b+1<<endl;
			}
		}
		else
		{
			if(c==a && b==a)
			cout<<1<<endl;
			else if(b==c)
			{
				cout<<a-b+1<<endl;
			}
			else
			{
				int t = min(b,c);
				cout<<a-t+1<<endl;
			}
		}
	}
	return 0;
}


# include <bits/stdc++.h>
using namespace std;
int   main(void)
{
	int n;
	cin>>n;
	while(n--)
	{
		long long a,b,c;
		cin>>a>>b>>c;
		if(b+c == a)
		{
			long long  t = min(b,c);
			cout<<t+1<<endl;
		}
		else
		{
			if(a==b && a==c)
			{
				cout<<1<<endl;
			}
			else
			{
				long long t = min(b,c);
				cout<<t+1<<endl;
			}
		}
	}
	return 0;
}


# include <bits/stdc++.h>
using namespace std;
int   main(void)
{
	int n;
	cin>>n;
	while(n--)
	{
		int a,b,c;
		cin>>a>>b>>c;
		if(b+c == a)
		{
			int t = min(b,c);
			cout<<t+1<<endl;
		}
		else
		{
			if(a==b && a==c)
			{
				cout<<1<<endl;
			}
			else
			{
				int t = min(b,c);
				cout<<t+1<<endl;
			}
		}
	}
	return 0;
}


# include <bits/stdc++.h>
using namespace std;
int   main(void)
{
	int n;
	cin>>n;
	while(n--)
	{
		int a,b,c;
		cin>>a>>b>>c;
		if(b+c==a)
		{
			cout<<a<<endl;
		}
		else  if(b+c>a)
		{
				if(a*2==b+c)
				{
					cout<<1<<endl;
				}
				else
				{
					int t = min(b,c);
				cout<<t+1<<endl;
				}

		}

	}
	return 0;
}


# include <bits/stdc++.h>
using namespace std;
int main(void)
{
	int n;
	cin>>n;
	while(n--)
	{
		long long a,b,c;
		cin>>a>>b>>c;
		if(b+c==a)
		{
			if(b == c)
				cout<<b+1<<endl;
			else if(b<c)
				cout<<c+1<<endl;
			else
				cout<<b+1<<endl;
		}
		else
		{
			if(b==a && c==a)
			cout<<1<<endl;
			else if(b<=c)
			cout<<a-b+1<<endl;
			else
			cout<<a-c+1<<endl;
		}
	}
	return 0 ;
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a <= b && a <= c) cout<<1<<endl;
//		else if(a <= b && a <= c) cout<<max(b,c)-a+1<<endl;
		else cout<<min(a,min(b,c)+1)<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else cout<<min(c,b)+1<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else if(a <= b && a <= c) cout<<min(c,b)<<endl;
		else cout<<a<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else cout<<min(a,b)+1<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else if(a <= b && a <= c){
			b -= a; c -= a;
			cout<<max(a,b)+1<<endl;
		}
		else cout<<min(a,b)+1<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a <= b && a <= c) cout<<1<<endl;
		else cout<<min(a,min(b,c)+1)<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c;
void solve(){
	scanf("%lld%lld%lld",&a,&b,&c);
	cout<<max(a-b,a-c)+1<<endl;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--) solve();
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else if(b < a && c < a) cout<<min(a,min(b,c)+1)<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a <= b && a <= c) cout<<1<<endl;
		else if(b < a && c < a) cout<<min(a,min(b,c)+1)<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;
long long a,b,c;
void solve(){
	scanf("%lld%lld%lld",&a,&b,&c);
	if(a == b && a == c) cout<<1<<endl;
	else if(a <= b && a <= c) cout<<0<<endl;
	else if(a >= b && a >= c) cout<<min(b,c)+1<<endl;
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--) solve();
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else if(a <= b && a <= c) cout<<max(b,c)-a+1<<endl;
		else cout<<min(a,min(b,c)+1)<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a >= b && a >= c) cout<<1<<endl;
		else cout<<min(a,b)+1<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a <= b && a <= c) cout<<1<<endl;
		else cout<<min(a,max(b,c)+1)<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else if(a >= b && a >= c){
			b -= a; c -= a;
			cout<<max(a,b)+1<<endl;
		}
		else cout<<min(a,b)+1<<endl;
	}
}


#include <bits/stdc++.h>
using namespace std;

int main(){
	int t; cin>>t;
	while(t--){
		int a,b,c;
		cin>>a>>b>>c;
		if(a == b && a == c) cout<<1<<endl;
		else if(a <= b && a <= c) cout<<a<<endl;
		else cout<<min(b,c)+1<<endl;
	}
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long t,i,a,b,c,d;
    vector<int >v;
    cin>>t;
    while(t--){
    for(i=0;i<3;i++)
    {
        cin>>a;
        v.push_back(a);
    }
    sort(v.begin(),v.end());
    b=v[0];
    c=v[1];
    d=v[2];
    if(b==c && c==d)
    {
        cout<<1<<endl;
    }
    else
        cout<<b+1<<endl;;
}
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long t,i,a,sum,sum1,m,b,c,d;
    int arr[10000];
    cin>>t;
    while(t--){
            sum1=0;
            m=1,sum=0,a=0,b=0,c=0;
    for(i=0;i<3;i++)
    {
        cin>>arr[i];

    }
    sort(arr,arr+3);
   a+=arr[0];
   b+=arr[1];
   c+=arr[2];
 if(b+c==a*2)
    {
        cout<<1<<endl;
    }
    else{
        cout<<a+1<<endl;
    }

}
}


//JAKARIA NOMANN_NSTU
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define GCD(a,b) __gcd(a,b)
#define vc vector<char>
#define vi vector<int>
#define si set<int>
#define sc set<char>
#define sti stack<int>
#define pb push_back
#define stc stack<char>
#define msi multiset<int>
#define LCM(a,b) ((a*b)/__gcd(a,b) )
#define ses "\n"
typedef long long ll;
typedef unsigned long long ull;
#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long t,i,a,sum,m,b,c,d;
    int arr[10000];
    cin>>t;
    while(t--){

        sum=0,a=0,b=0,c=0;
    for(i=0;i<3;i++)
    {
        cin>>arr[i];
    }
    sort(arr,arr+3);
   a+=arr[0];
   b+=arr[1];
   c+=arr[2];
 sum+=c-a+1;
 cout<<sum;

}
}


#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long t,i,a,sum,sum1,m,b,c,d;
    int arr[10000];
    cin>>t;
    while(t--){
            sum1=0;
            m=1,sum=0,a=0,b=0,c=0;
    for(i=0;i<3;i++)
    {
        cin>>arr[i];
        sum+=arr[i];
    }
    sort(arr,arr+3);
   a+=arr[0];
   b+=arr[1];
   c+=arr[2];

 //cout<<sum1<<endl;
 if(a==b && b==c)
    {
        cout<<1<<endl;
    }
    else{
        cout<<a+1<<endl;
    }

}
}


//JAKARIA NOMANN_NSTU
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define GCD(a,b) __gcd(a,b)
#define vc vector<char>
#define vi vector<int>
#define si set<int>
#define sc set<char>
#define sti stack<int>
#define pb push_back
#define stc stack<char>
#define msi multiset<int>
#define LCM(a,b) ((a*b)/__gcd(a,b) )
#define ses "\n"
typedef long long ll;
typedef unsigned long long ull;
#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long t,i,a,sum,m,b,c,d;
    int arr[10000];
    cin>>t;
    while(t--){

        sum=0,a=0,b=0,c=0;
    for(i=0;i<3;i++)
    {
        cin>>arr[i];
    }
    sort(arr,arr+3);
   a+=arr[0];
   b+=arr[1];
   c+=arr[2];
 sum+=c-a+1;
 cout<<sum<<endl;

}
}


//JAKARIA NOMANN_NSTU
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define GCD(a,b) __gcd(a,b)
#define vc vector<char>
#define vi vector<int>
#define si set<int>
#define sc set<char>
#define sti stack<int>
#define pb push_back
#define stc stack<char>
#define msi multiset<int>
#define LCM(a,b) ((a*b)/__gcd(a,b) )
#define ses "\n"
typedef long long ll;
typedef unsigned long long ull;
#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long t;
    cin>>t;
    while(t--)
    {
        int n,a,b;
        cin>>n>>a>>b;
        cout<<(n-(min(a,b))+1)<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
//typedef long long ll;
typedef long double ll;
#define vt vector
#define all(v)  v.begin(),v.end()
typedef vt<long long> vii;
const ll M=998244353;
 int main()
{
ll t;
cin>>t;
while(t-->0)
{
ll n,s,t;
cin>>n>>s>>t;
if(s+t==n)
    cout<<n<<endl;
else
{
    ll m=min(s,t);
    cout<<n-m+1<<endl;
}
}
  return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
//typedef long long ll;
typedef long long ll;
#define vt vector
#define all(v)  v.begin(),v.end()
typedef vt<long long> vii;
const ll M=998244353;
 int main()
{
ll t;
cin>>t;
while(t-->0)
{
ll n,s,t;
cin>>n>>s>>t;
if(s+t==n)
    cout<<n<<endl;
else
{
    ll m=min(s,t);
    cout<<n-m+1<<endl;
}
}
  return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
//typedef long long ll;
typedef long long ll;
#define vt vector
#define all(v)  v.begin(),v.end()
typedef vt<long long> vii;
const ll M=998244353;
 int main()
{
ll t;
cin>>t;
while(t-->0)
{
ll n,s,t;
cin>>n>>s>>t;
if(s+t==n)
    cout<<n<<endl;
else
{
    ll m=min(s,t);
    cout<<max(n-m+1,n-max(s,t)+1)<<endl;
}
}
  return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
//typedef long long ll;
typedef long long ll;
#define vt vector
#define all(v)  v.begin(),v.end()
typedef vt<long long> vii;
const ll M=998244353;
 int main()
{
ll t;
cin>>t;
while(t-->0)
{
ll n,s,t;
cin>>n>>s>>t;
if(s+t==n)
    cout<<n<<endl;
else
{
    ll m=min(s,t);
    cout<<max(n-m,n-max(s,t))+1<<endl;
}
}
  return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
//typedef long long ll;
typedef long long ll;
#define vt vector
#define all(v)  v.begin(),v.end()
typedef vt<long long> vii;
const ll M=998244353;
 int main()
{
ll t;
cin>>t;
while(t-->0)
{
ll n,s,t;
cin>>n>>s>>t;
    ll m=min(s,t);
    cout<<max(n-m,n-max(s,t))+1<<endl;
}
  return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
//typedef long long ll;
typedef long double ll;
#define vt vector
#define all(v)  v.begin(),v.end()
typedef vt<long long> vii;
const ll M=998244353;
 int main()
{
ll t;
cin>>t;
while(t-->0)
{
ll n,s,t;
cin>>n>>s>>t;
if(s+t==n)
    cout<<n<<endl;
else
{
    ll m=max(s,t);
    cout<<n-min(s,t)+1<<endl;
}
}
  return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define fr(i,a,b) for(int i=a;i>=b;i--)
//typedef long long ll;
typedef long double ll;
#define vt vector
#define all(v)  v.begin(),v.end()
typedef vt<long long> vii;
const ll M=998244353;
 int main()
{
ll t;
cin>>t;
while(t-->0)
{
ll n,s,t;
cin>>n>>s>>t;
if(s+t==n)
    cout<<n<<endl;
else
{
    ll m=max(s,t);
    cout<<m-(m-min(s,t))+1<<endl;
}
}
  return 0;
}


#include<bits/stdc++.h>
using namespace std;
#define ll long
int main(){
    ll test,n,s,t; cin>>test;
    while(test--){
        cin>>n>>s>>t;
        if(n-min(s,t)<=max(s,t)) cout<<n-min(s,t)+1;
        else cout<<min(s,t)+1<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
#define ll long
int main(){
    ll test,n,s,t; cin>>test;
    while(test--){
        cin>>n>>s>>t;
        if(s+t==n) cout<<max(s,t)+1<<endl;
        else if(s==n || t==n){
            if(n-min(s,t)>min(s,t)) cout<<min(s,t)<<endl;
            else cout<<n-min(s,t)+1<<endl;
        }
        else if(s==t) cout<<max(s,t)<<endl;
        else cout<<min(s,t)+1<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
#define ll long
int main(){
    ll test,n,s,t; cin>>test;
    while(test--){
        cin>>n>>s>>t;
        if(s+t==n) cout<<max(s,t)+1<<endl;
        else if(s==n || t==n){
            if(n-min(s,t)>min(s,t)) cout<<min(s,t)<<endl;
            else cout<<n-min(s,t)+1<<endl;
        }
        else if(s==t) cout<<n-max(s,t)+1<<endl;
        else cout<<min(s,t)+1<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
#define ll long
int main(){
    ll test,n,s,t; cin>>test;
    while(test--){
        cin>>n>>s>>t;
        if(s+t==n) cout<<min(s,t)+1<<endl;
        else if(s==n || t==n){
            if(n-min(s,t)>min(s,t)) cout<<max(s,t)+1<<endl;
            else cout<<n-min(s,t)+1<<endl;
        }
        else{
            if(n-min(s,t)<min(s,t)) cout<<n-min(s,t)+1;
            else cout<<min(s,t)+1<<endl;
        }
    }
}


#include<bits/stdc++.h>
using namespace std;
#define ll long
int main(){
    ll test,n,s,t; cin>>test;
    while(test--){
        cin>>n>>s>>t;
        if(s+t==n) cout<<min(s,t)+1<<endl;
        else if(s==n || t==n){
            if(n-min(s,t)<min(s,t)) cout<<min(s,t)+1<<endl;
            else cout<<n-min(s,t)+1<<endl;
        }
        else if(s==t) cout<<n-max(s,t)+1<<endl;
        else cout<<min(s,t)+1<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
#define ll long
int main(){
    ll test,n,s,t; cin>>test;
    while(test--){
        cin>>n>>s>>t;
        if(n-min(s,t)<=max(s,t)) cout<<n-min(s,t)+1<<endl;
        else cout<<min(s,t)+1<<endl;
    }
}


#include<bits/stdc++.h>
using namespace std;
#define ll long
int main(){
    ll test,n,s,t; cin>>test;
    while(test--){
        cin>>n>>s>>t;
        if(s+t==n) cout<<min(s,t)+1<<endl;
        else if(s==n || t==n){
            if(n-min(s,t)>min(s,t)) cout<<max(s,t)+1<<endl;
            else cout<<n-min(s,t)+1<<endl;
        }
        else if(s==t) cout<<n-max(s,t)+1<<endl;
        else cout<<min(s,t)+1<<endl;
    }
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
int sum=0;
for(int i=0;i<T;i++){
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum=minn+1;
          }
          else if(n==s && s==t) sum=1;
          else sum=s+t;
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          int sum=0;
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum=minn+1;
          }
          else if(n==s && s==t) sum+=1;
          else
          {if(s==t && n!=s && s+t<=n) sum+=(s+t);
          else while(true){
                    s--; t--;
          if(s+t<=n){ sum+=(s+t); break;}
          }
          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
int sum=0;
for(int i=0;i<T;i++){
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum=minn+1;
          }
          else if(n==s && s==t) sum=1;
          else
          {if(s==t && n!=s && s+t<=n) sum=s+t;
          else while(s+t<=n){
                    s--; t--;
          if(s+t<=n) sum+=(s+t);
          }
          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T,k=1;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          if(minn>n/2) sum+=minn;
          else if(minn==n/2) sum+=minn+1;
          else{ sum+=minn;
          while(sum<=n/2){
          sum+=k;
          }
          }
          }
           else if (n==s && s==t) sum+=1;
           else{ if(s+t==n/2) sum+=s+1;
           else sum+=(s/2)+1;
           }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T,k=1;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          if(minn>n/2) sum+=(n/2)+1;
          else if(minn==n/2) sum+=minn+1;
          else{ sum+=(n/2)+1;
          }
          }
          }
           else if (n==s && s==t) sum+=1;
           else{ if(s==n/2) sum+=s+1;
           else sum+=(n/2)+1;
           }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s+t>=n){
          if(s<t || t<s){
          minn=min(s,t);
          sum+=minn+1;
          }
          else{

           if (n==s && s==t) sum+=1;
           else{ if(s+t==n) sum+=(t+s);
           else while(s!=n){
                    s--; t--;
                    if(s+t==n) sum+=(s+t);
           }
           }
          }
          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s+t>=n){
          if(s<t || t<s){
          minn=min(s,t);
          sum+=minn+1;
          }
          else{

           if (n==s && s==t) sum+=1;
           else{ if(s+t==n) sum+=(t+s);
           else sum+=s;
           }
          }
          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          int sum=0;
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum=minn+1;
          }
          else if(n==s && s==t) sum+=1;
          else
          {if(s==t && n!=s && s+t<=n) sum+=(s+t);
          else while(s+t<=n){
                    s--; t--;
          if(s+t<=n) sum+=(s+t);
          }
          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
int sum=0;
for(int i=0;i<T;i++){
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum=minn+1;
          }
          else if(n==s && s==t) sum=1;
          else if(s==t && n!=s) sum=s+t;
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T,k=1;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          if(minn>n/2) sum+=minn;
          else if(minn==n/2) sum+=minn+1;
          else{ sum+=minn;
          while(sum<=n/2){
          sum+=k;
          }
          }
          }
           else if (n==s && s==t) sum+=1;
           else{ if(s==n/2) sum+=s+1;
           else sum+=((s+t)/2);
           }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          int sum=0;
          int minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum+=minn+1;
          }
          else{

           if (n==s && s==t) sum+=1;
           else sum+=(t+s);

          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T,k=1;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          if(minn>n/2) sum+=(n/2)+1;
          else if(minn==n/2) sum+=minn+1;
          else{ sum+=minn;
          while(sum<=n/2){
          sum+=k;
          }
          }
          }
           else if (n==s && s==t) sum+=1;
           else{ if(s==n/2) sum+=s+1;
           else sum+=(n/2)+1;
           }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
int sum=0;
for(int i=0;i<T;i++){
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum=minn+1;
          }
          else if(n==s && s==t) sum=1;
          else {sum=n-s; sum+=1;}
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T,k=1;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          if(minn>n/2) sum+=minn;
          else if(minn==n/2) sum+=minn+1;
          else{ sum+=minn;
          while(sum<=n/2){
          sum+=k;
          }
          }
          }
           else if (n==s && s==t) sum+=1;
           else{ if(s==n/2) sum+=s+1;
           else sum+=(s/2)+1;
           }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
int sum=0;
for(int i=0;i<T;i++){
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum=minn+1;
          }
          else if(n==s && s==t) sum=1;
          else if(s==t && n!=s && s+t<=n) sum=s+t;
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          sum=n-min(s,t)+1;
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          int sum=0;
          int minn=0;
          int n; cin>>n;
          int s; cin>>s;
          int t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum+=minn+1;
          }
          else if(n==s && s==t) sum+=1;
          else
          {if(s==t && n!=s && s+t<=n) sum+=(s+t);
          else while(n!=s){
                    s--; t--;
          if(s+t<=n){ sum+=(s+t); break;}
          }
          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T,k=1;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          if(minn>n/2) sum+=minn;
          else if(minn==n/2) sum+=minn+1;
          else{ sum+=minn;
          while(sum<=n/2){
          sum+=k;
          }
          }
          }
           else if (n==s && s==t) sum+=1;
           else{ if(s+t==n) sum+=s+t;
           else sum+=(s/2);
           }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          long long sum=0;
          long long minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum+=minn+1;
          }
          else{

           if (n==s && s==t) sum+=1;
           else sum+=(t+s);

          }
          cout<<sum<<endl;

}
return 0;
}


#include<iostream>
#include <string>
#include <typeinfo>
#include <map>
#include <stack>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cmath>
using namespace std;
int main (){
ios_base::sync_with_stdio(0); cin.tie(0);
int T;
cin>>T;
for(int i=0;i<T;i++){
          int sum=0;
          int minn=0;
          long long n; cin>>n;
          long long s; cin>>s;
          long long t; cin>>t;
          if(s<t || t<s){
          minn=min(s,t);
          sum+=minn+1;
          }
          else if(n==s && s==t) sum+=1;
          else
          {if(s==t && n!=s && s+t<=n) sum+=(s+t);
          else while(n!=s){
                    s--; t--;
          if(s+t<=n){ sum+=(s+t); break;}
          }
          }
          cout<<sum<<endl;

}
return 0;
}


#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,s,t,mi,ma;
        cin>>n>>s>>t;
        if(s>t)
        {
            mi=t;
            ma=s;
        }
        else
        {
            mi=s; ma=t;
        }

        int ss=n-ma;
        mi-=ss; //st
        int tt=n-(ss+mi);

        cout<<max(ss,tt)+1<<endl;

    }

    return 0;
}


#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,s,t;
        cin>>n>>s>>t;
        if(s==t && n==t)cout<<1<<endl;
        else cout<<min(s,t)+1<<endl;
    }

    return 0;
}


#include <iostream>

using namespace std;

int main()
{
    int n,s,t,y;
    cin>>y;
    for(int i=0;i<y;i++)
    {
    cin>>n;
    cin>>s;
    cin>>t;
    if(s<=t)
    {
   int p=(s%n)+1;
   cout<<p<<endl;
    }
    else if(t<s)
    {
        int j=(t%n)+1;
        cout<<j<<endl;
    }
    }
    return 0;
}


#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,s,t;
        cin>>n>>s>>t;
        cout<<min(s,t)+1<<endl;
    }

    return 0;
}


#include <iostream>

using namespace std;

int main()
{
    int n,s,t,y;
    cin>>y;
    for(int i=0;i<y;i++)
    {
    cin>>n;
    cin>>s;
    cin>>t;
    if(s<=t)
    {
   int p=(n-s)+1;
   cout<<p<<endl;
    }
    else if(t<s)
    {
        int j=(n-t)+1;
        cout<<j<<endl;
    }
    }
    return 0;
}


#include <iostream>

using namespace std;

int main()
{
    int n,s,t,y;
    cin>>y;
    for(int i=0;i<y;i++)
    {
    cin>>n;
    cin>>s;
    cin>>t;

   int p=(s%n)+1;
   cout<<p<<endl;
    }
    return 0;
}


#include <iostream>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,s,t;
        cin>>n>>s>>t;
        if(s==t)cout<<1<<endl;
        else cout<<min(s,t)+1<<endl;
    }

    return 0;
}


#include <bits/stdc++.h>

using namespace std;
typedef long long INT;
typedef double DO;
typedef pair<int, int> pii;
typedef vector<int> VI;

#define x first
#define y second
#define pb push_back

int power(int a, int b, int c, int ans=1) {
	for (; b; b>>=1, a=(INT)a*a%c) if (b&1) ans=(INT)ans*a%c;
	return ans;
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("in.in", "r", stdin);
	freopen("out.out", "w", stdout);
#endif

	int T, s, t, n;
	for (cin>>T; T--; ) {
		cin>>n>>s>>t;
		printf("%d\n", n-min(s, t)+1);
	}

	return 0;
}


#include<bits/stdc++.h>

#define x first
#define y second

using namespace std;

typedef long long INT;

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	ios_base::sync_with_stdio(0); cin.tie(0);
	int T;
	cin >> T;
	while(T--) {
		int n, s, t;
		cin >> n >> s >> t;
		cout << n - min(s, t) + 1 << endl;
	}

	return 0;
}


//2019.7.6 by ljz
#include<bits/stdc++.h>
using namespace std;
#define res register int
#define LL long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f
#define eps 5.6e-8
#define RG register
#define db long double
#define pc(x) __builtin_popcount(x)
typedef pair<int,int> Pair;
#define mp make_pair
#define fi first
#define se second
#define pi acos(-1.0)
#define pb push_back
#define gc getchar
//inline char gc() {
//    static char buf[100000],*p1,*p2;
//    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
//}
//inline int read() {
//    res s=0,ch=gc();
//    while(ch<'0'||ch>'9')ch=gc();
//    while(ch>='0'&&ch<='9')s=s*10+ch-'0',ch=gc();
//    return s;
//}
inline int read() {
    res s=0,ch=gc(),w=1;
    while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=gc();}
    while(ch>='0'&&ch<='9')s=s*10+ch-'0',ch=gc();
    return s*w;
}
//inline LL Read() {
//    RG LL s=0;
//    res ch=gc();
//    while(ch<'0'||ch>'9')ch=gc();
//    while(ch>='0'&&ch<='9')s=s*10+ch-'0',ch=gc();
//    return s;
//}
//inline LL Read() {
//    RG LL s=0;
//    res ch=gc(),w=1;
//    while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=gc();}
//    while(ch>='0'&&ch<='9')s=s*10+ch-'0',ch=gc();
//    return s*w;
//}
inline void swap(res &x,res &y) {
    x^=y^=x^=y;
}
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int kcz=1e9+7;
const int N=2e2+10;
namespace MAIN{
    int n;
    struct P{
        int x,y;
        P() {}
        P(res x,res y):x(x),y(y) {}
    }a[N];
    inline LL operator * (const RG P &A,const RG P &B){
        return 1LL*A.x*B.y-1LL*A.y*B.x;
    }
    inline P operator - (const RG P &A,const RG P &B){
        return P(A.x-B.x,A.y-B.y);
    }
    inline void add(res &x,const res &y){
        x+=y,x>=kcz?x-=kcz:1;
    }
    inline int Add(const res &x,const res &y){
        return x+y>=kcz?x+y-kcz:x+y;
    }
    inline int mul(const res &x,const res &y){
        return int(1LL*x*y%kcz);
    }
    int dp[N][N];
    inline void MAIN(){
        n=read();
        for(res i=1;i<=n;i++){
            res x=read(),y=read();
            a[i]=P(x,y);
        }
        RG LL tmp=a[n]*a[1];
        for(res i=1;i<n;i++)tmp+=a[i]*a[i+1];
        if(tmp>0)reverse(a+1,a+n+1);
        for(res i=1;i<n;i++)dp[i][i+1]=1;
        for(res len=2;len<n;len++)
            for(res l=1,r=l+len;r<=n;l++,r++)
                for(res k=l;k<=r;k++)
                    if((a[r]-a[l])*(a[k]-a[l])>0)add(dp[l][r],mul(dp[l][k],dp[k][r]));
        printf("%d\n",dp[1][n]);
    }
}
int main() {
//    srand((unsigned)time(NULL));
    // freopen("zao.in","r",stdin);
    // freopen("std.out","w",stdout);
    MAIN::MAIN();
    return 0;
}


#include <cstdio>
#include <algorithm>
using namespace std;
#define rep(i, a, n) for (int i = a; i < (int)n; i++)
const int N = 210, mod = 1000000007;
bool crs(int x1, int y1, int x2, int y2) {
  return (1ll * x1 * y2 - 1ll * x2 * y1) > 0;
}
int dp[N][N];
int x[N], y[N], n;
int main() {
  scanf("%d", &n);
  rep(i, 0, n) scanf("%d%d", x + i, y + i);
  long long s = 0;
  rep(i, 0, n) s += 1ll * x[i] * y[(i + 1) % n] - 1ll * y[i] * x[(i + 1) % n];
  if (s > 0) reverse(x, x + n), reverse(y, y + n);
  rep(d, 1, n) rep(i, 0, n - d) {
    int j = i + d;
    if (d == 1)
      dp[i][j] = 1;
    else
      rep(k, i + 1,
          j) if (crs(x[k] - x[i], y[k] - y[i], x[k] - x[j], y[k] - y[j]))
          dp[i][j] = (dp[i][j] + 1ll * dp[i][k] * dp[k][j]) % mod;
  }
  printf("%d\n", dp[0][n - 1]);
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define N 210

int n;
long long dp[N][N];

struct point {
	long long x, y;
    void read() {scanf("%I64d%I64d", &x, &y);}
} P[N];

long long cross(point a, point b, point c) {return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);}

int main() {
	long long s;
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++) P[i].read();
    P[n + 1] = P[1];
    for (int i = 1; i <= n; i ++) s += cross(P[1], P[i], P[i + 1]);
    if (s > 0) for (int i = 1; i <= n / 2; i ++) swap(P[i], P[n - i + 1]);
    for (int i = 1; i < n; i ++) dp[i][i + 1] = 1;
	for (int i = 2; i < n; i ++) for (int j = 1; j <= n - i; j ++) for (int k = j + 1; k < i + j; k ++)
				if (cross(P[j], P[i + j], P[k]) > 0) dp[j][i + j] = (dp[j][i + j] + dp[j][k] * dp[k][i + j]) % mod;
	printf("%I64d", dp[1][n]);
}


#include <bits/stdc++.h>
using namespace std;
#define N 205
#define ll long long

const int mod = 1e9 + 7;
ll dp[N][N], x[N], y[N], t;

ll f(ll a, ll b, ll c, ll d){
	return a * d - b * c;
}

ll func(int a, int b){
	if(b == a + 1) return dp[a][b] = 1;
	if(dp[a][b] != -1) return dp[a][b];
	dp[a][b] = 0;
	for(int i = a + 1; i < b; i++) if(f(x[b] - x[i], y[b] - y[i], x[a] - x[i], y[a] - y[i]) > 0) dp[a][b] = (func(a, i) * func(i, b) + dp[a][b]) % mod;
	return dp[a][b];
}

int main(){
	int i, n;
	memset(dp, -1, sizeof dp);
	scanf("%d", &n);
	for(i = 1; i <= n; i++) scanf("%I64d %I64d", x + i, y + i);
	for(i = 1; i < n; i++) t += f(x[i], y[i], x[i + 1], y[i + 1]);
	t += f(x[n], y[n], x[1], y[1]);
	if(t < 0){
		reverse(x + 1, x + n + 1);
		reverse(y + 1, y + n + 1);
	}
	printf("%I64d", func(1, n));
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define N 210

int n;
long long dp[N][N];

struct point {
	long long x, y;
    void read() {scanf("%I64d%I64d", &x, &y);}
} P[N];

long long cross(point a, point b, point c) {return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);}

int main() {
	long long s;
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++) P[i].read();
    p[n + 1] = p[1];
    for (int i = 1; i <= n; i ++) s += cross(P[1], P[i], P[i + 1]);
    if (s > 0) for (int i = 1; i <= n / 2; i ++) swap(p[i], p[n - i + 1]);
    for (int i = 1; i < n; i ++) dp[i][i + 1] = 1;
	for (int i = 2; i < n; i ++) for (int j = 1; j <= n - i; j ++) for (int k = j + 1; k < i + j; k ++)
				if (cross(p[j], p[i + j], p[k]) > 0) dp[j][i + j] = (dp[j][i + j] + dp[j][k] * dp[k][i + j]) % mod;
	printf("%I64d", dp[1][n]);
}


#include <bits/stdc++.h>
using namespace std;

#define mod 1000000007
#define N 210

int n;
long long dp[N][N];

struct point {
	long long x, y;
    void read() {scanf("%I64d%I64d", &x, &y);}
} P[N];

long long cross(point a, point b, point c) {return (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);}

int main() {
	long long s = 0;
	scanf("%d", &n);
	for (int i = 1; i <= n; i ++) P[i].read();
    P[n + 1] = P[1];
    for (int i = 2; i <= n; i ++) s += cross(P[1], P[i], P[i + 1]);
    if (s > 0) for (int i = 1; i <= n / 2; i ++) swap(P[i], P[n - i + 1]);
    for (int i = 1; i < n; i ++) dp[i][i + 1] = 1;
	for (int i = 2; i < n; i ++) for (int j = 1; j <= n - i; j ++) for (int k = j + 1; k < i + j; k ++)
				if (cross(P[j], P[i + j], P[k]) > 0) dp[j][i + j] = (dp[j][i + j] + dp[j][k] * dp[k][i + j]) % mod;
	printf("%I64d", dp[1][n]);
}


#include <bits/stdc++.h>
using namespace std;
#define N 205
#define ll long long

const int mod = 1e9 + 7;
ll dp[N][N], x[N], y[N];

ll f(ll a, ll b, ll c, ll d){
	return a * d - b * c;
}

ll func(int a, int b){
	if(b == a + 1) return dp[a][b] = 1;
	if(dp[a][b] != -1) return dp[a][b];
	dp[a][b] = 0;
	for(int i = a + 1; i < b; i++) if(f(x[a] - x[b], y[a] - y[b], x[i] - x[b], y[i] - y[b]) > 0) dp[a][b] = (func(a, i) * func(i, b) + dp[a][b]) % mod;
	return dp[a][b];
}

int main(){
	int i, n;
	memset(dp, -1, sizeof dp);
	scanf("%d", &n);
	for(i = 1; i <= n; i++) scanf("%I64d %I64d", x + i, y + i);
	if(f(x[1] - x[3], y[1] - y[3], x[2] - x[3], y[2] - y[3]) < 0){
		reverse(x + 1, x + n + 1);
		reverse(y + 1, y + n + 1);
	}
	printf("%I64d", func(1, n));
}


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 205;
const ll M = 1e9+7;

ll dp[N][N];
struct P{
  ll x,y;
  P(){}
  P(ll x,ll y):x(x),y(y){}
} p[N];

inline ll cal(P a,P b){
	return a.x*b.y-a.y*b.x;
}

inline P Pc(P a,P b){
	return P(a.x-b.x,a.y-b.y);
}

inline void re(ll n){
	ll i = 0,j = n-1;
	while(i < j){
		P t = p[i];
		p[i] = p[j];
		p[j] = t;
		i++;
		j--;
	}
	return ;
}

int main() {
  	ll n,sum = 0;
  	scanf("%lld",&n);
  	for(ll i = 0;i < n;++i) scanf("%lld%lld",&p[i].x,&p[i].y);
  	for(ll i = 1;i < n-1;++i) sum += cal(Pc(p[i],p[0]),Pc(p[i+1],p[0]));
  	if (sum < 0) re(n);

  	for(ll i = 0;i < n;++i) dp[i][(i+1)%n] = 1;
  	for(ll l = 2;l <= n;++l){
	    for(ll i = 0;i < n;++i){
	      	ll j = (i+l)%n;
	      	for(ll k = (i+1)%n;k != j;(++k) %= n)
	        if (cal(Pc(p[k],p[i]),Pc(p[j],p[i])) > 0) (dp[i][j]+=dp[i][k]*dp[k][j]) %= M;
	    }
	}
  	printf("%lld\n",dp[0][n - 1]);
  	return 0;
}//hello


#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#define ll long long
const ll Mod=1000000007;
ll f[5005][5005];
struct Point{
	double x,y;
	Point(){}
	Point(double x0,double y0):x(x0),y(y0){}
}p[500005];
Point operator -(Point p1,Point p2){
	return Point(p1.x-p2.x,p1.y-p2.y);
}
double operator *(Point p1,Point p2){
	return p1.x*p2.y-p1.y*p2.x;
}
int read(){
	int t=0,f=1;char ch=getchar();
	while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
	while ('0'<=ch&&ch<='9'){t=t*10+ch-'0';ch=getchar();}
	return t*f;
}
ll solve(int l,int r){
	if (f[l][r]!=-1) return f[l][r];
	if (l>r) return f[l][r]=0;
	if (l+1==r) return f[l][r]=1;
	f[l][r]=0;
	for (int i=l+1;i<r;i++){
		if ((p[r]-p[l])*(p[i]-p[l])<0)
		 (f[l][r]+=(solve(l,i)*solve(i,r))%Mod)%=Mod;
	}
	return f[l][r];
}
int main(){
    int n=read();
    for (int i=1;i<=n;i++) p[i].x=read(),p[i].y=read();
    for (int i=1;i<=n;i++)
     for (int j=1;j<=n;j++)
      f[i][j]=-1;
	double res=0;
    p[n+1]=p[1];
    for (int i=1;i<=n;i++)
     res+=p[i]*p[i+1];
    if (res<0){
	 for (int i=1;i<=n/2;i++) std::swap(p[i],p[n-i+1]);
    }
    printf("%I64d\n",solve(1,n));
}


// God & me
// Life is ruined and love is lost :'(
// @Yazd
#include <bits/stdc++.h>
#define pb push_back
#define X first
#define Y second
#define int long long
using namespace std;
template <class T, class L> bool smax(T &x,L y){  return x < y ? ( x = y, 1) : 0;  }
template <class T, class L> bool smin(T &x,L y){  return y < x ? ( x = y, 1) : 0;  }
typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 2e2 + 17, mod = 1e9 + 7;
struct P{  int x, y;  }  p[maxn];
struct L{  P f, s;  }  l[maxn];
int n, dp[maxn][maxn];
bool can[maxn][maxn];
int cross(P a, P b, P c){
    int ret = (b.x - a.x) * (c.y - a.y) - (b.y - a.y) * (c.x - a.x);
    if(ret < 0)  return -1;
    if(ret > 0)  return 1;
    return 0;
}
bool inter(L a, L b){
    if(max(a.f.x, a.s.x) < min(b.f.x, b.s.x) || max(a.f.y, a.s.y) < min(b.f.y, b.s.y) ||
       max(b.f.x, b.s.x) < min(a.f.x, a.s.x) || max(b.f.y, b.s.y) < min(a.f.y, a.s.y))
	return 0;
    if(cross(a.f, a.s, b.f) * cross(a.f, a.s, b.s) > 0)  return 0;
    swap(a, b);
    if(cross(a.f, a.s, b.f) * cross(a.f, a.s, b.s) > 0)  return 0;
    return 1;
}
bool inter(P p){
    L li = {p, {p.x + 17, 1000000000}};
    int cnt = 0;
    for(int i = 0; i < n; i++){
	cnt += inter(li, l[i]);
	if(min(l[i].f.x, l[i].s.x) <= p.x && p.x <= max(l[i].f.x, l[i].s.x) &&
	   min(l[i].f.y, l[i].s.y) <= p.y && p.y <= max(l[i].f.y, l[i].s.y) &&
	   cross(l[i].f, l[i].s, p) == 0)
	    return 0;
    }
    return cnt & 1;
}
bool ok(L li){
    int cnt = 0;
    for(int i = 0; i < n; i++)
	cnt += inter(li, l[i]);
    return cnt == 4 && inter({(li.f.x + li.s.x) / 2, (li.f.y + li.s.y) / 2});
}
main(){
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n;
    if(n == 3)
	return cout << "1\n", 0;
    for(int i = 0, x, y; i < n; i++){
	cin >> x >> y, x *= 2, y *= 2;
	l[i].f.x = l[(i + n - 1) % n].s.x = x;
	l[i].f.y = l[(i + n - 1) % n].s.y = y;
	p[i] = {x, y};
    }
    for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++){
	    can[i][j] = i != j && ok({p[i], p[j]});
	    //cerr << can[i][j] << " \n" [j == n - 1];
	}
    for(int i = 0; i < n - 2; i++)
	if(can[i][i + 2])
	    dp[i][i + 3] = 1;
    for(int l = 4; l <= n; l++)
	for(int i = 0; i < n - l + 1; i++){
	    int j = i + l;
	    if(can[j - 1][i + 1])  dp[i][j] += dp[i + 1][j];
	    if(can[i][j - 2])      dp[i][j] += dp[i][j - 1];
	    dp[i][j] %= mod;
	    for(int k = i; k < j; k++)
		if(can[i][k] && can[k][j - 1])
		    (dp[i][j] += dp[i][k + 1] * dp[k][j]) %= mod;
	}
    cout << dp[0][n] << '\n';
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 205;
const ll M = 1e9+7;

ll dp[N][N];
struct P{
  ll x,y;
  P(){}
  P(ll x,ll y):x(x),y(y){}
} p[N];

inline ll cal(P a,P b){
	return a.x*b.y-a.y*b.x;
}

inline P Pc(P a,P b){
	return P(a.x-b.x,a.y-b.y);
}

inline void re(ll n){
	ll i = 0,j = n-1;
	while(i < j){
		P t = p[i];
		p[i] = p[j];
		p[j] = t;
		i++;
		j--;
	}
	return ;
}

int main() {
  	ll n,sum = 0;
  	scanf("%lld",&n);
  	for(ll i = 0;i < n;++i) scanf("%lld%lld",&p[i].x,&p[i].y);
  	for(ll i = 1;i < n-1;++i) sum += cal(Pc(p[i],p[0]),Pc(p[i+1],p[0]));
  	if (sum < 0) re(n);

  	for(ll i = 0;i < n;++i) dp[i][(i+1)%n] = 1;
  	for(ll l = 2;l <= n;++l){
	    for(ll i = 0;i < n;++i){
	      	ll j = (i+l)%n;
	      	for(ll k = (i+1)%n;k != j;(++k) %= n)
	        if (cal(Pc(p[k],p[i]),Pc(p[j],p[i])) > 0) (dp[i][j]+=dp[i][k]*dp[k][j]) %= M;
	    }
	}
  	printf("%lld\n",dp[0][n - 1]);
  	return 0;
}//hello//hello


#include <iostream>
#include <cstring>
using namespace std;
int n,dp[205][205],M=1e9+7;
struct point
{
    long long x,y;
    struct point operator -(struct point A)
    {
        struct point t;
        t.x=x-A.x;
        t.y=y-A.y;
        return t;
    };
    long long  operator *(struct point A)
    {
        return x*A.y-y*A.x;
    }
} p[205];
long long dfs(int l,int r)
{
    //cout<<l<<" * "<<r<<endl;
    if(dp[l][r]!=-1) return dp[l][r]; //cout<<"**************"<<endl;
    if(r-l<=1) return dp[l][r]=1;
    dp[l][r]=0;
    for(int i=l+1; i<r; i++)
    {
       // cout<<(p[l]-p[r]).x<<" "<<(p[l]-p[r]).y<<endl;
        //cout<<(p[i]-p[r]).x<<" "<<(p[i]-p[r]).y<<endl;
        //cout<<(p[l]-p[r])*(p[i]-p[r])<<endl;
        if((p[l]-p[r])*(p[i]-p[r])>0)
        {
            dp[l][r]=(dp[l][r]+dfs(l,i)*dfs(i,r))%M;
        }
    }
    return dp[l][r];
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++) cin>>p[i].x>>p[i].y;
    p[n]=p[0];
    long long temp=0;
    for(int i=1;i<=n;i++) temp+=p[i-1]*p[i];
    if(temp<0)
    {
        //cout<<"<0"<<endl;
        for(int i=0; i<n/2; i++) swap(p[i],p[n-i-1]);
    }
    memset(dp,-1,sizeof(dp));
    cout<<dfs(0,n-1)<<endl;
    return 0;
}


#include <iostream>
#include <cstring>
using namespace std;
int n,dp[205][205],M=1e9+7;
struct point
{
    long long x,y;
    struct point operator -(struct point A)
    {
        struct point t;
        t.x=x-A.x;
        t.y=y-A.y;
        return t;
    };
    long long  operator *(struct point A)
    {
        return x*A.y-y*A.x;
    }
} p[205];
long long dfs(int l,int r)
{
    if(dp[l][r]) return dp[l][r];
    if(r-l==1) return 1;
    for(int i=l+1; i<r; i++)
    {
        if((p[l]-p[r])*(p[i]-p[r])>0)
            dp[l][r]=(dp[l][r]+dfs(l,i)*dfs(i,r))%M;
    }
    return dp[l][r];
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++) cin>>p[i].x>>p[i].y;
    if((p[1]-p[0])*(p[2]-p[0])<0) for(int i=0; i<n/2; i++) swap(p[i],p[n-i-1]);
    memset(dp,0,sizeof(dp));
    cout<<dfs(0,n-1)<<endl;
    return 0;
}


#include <iostream>
#include <cstring>
using namespace std;
int n,dp[205][205],M=1e9+7;
struct point
{
    long long x,y;
    struct point operator -(struct point A)
    {
        struct point t;
        t.x=x-A.x;
        t.y=y-A.y;
        return t;
    };
    long long  operator *(struct point A)
    {
        return x*A.y-y*A.x;
    }
} p[205];
long long dfs(int l,int r)
{
    //cout<<l<<" * "<<r<<endl;
    if(dp[l][r]) return dp[l][r]; //cout<<"**************"<<endl;
    if(r-l<=1) return 1;
    for(int i=l+1; i<r; i++)
    {
       // cout<<(p[l]-p[r]).x<<" "<<(p[l]-p[r]).y<<endl;
        //cout<<(p[i]-p[r]).x<<" "<<(p[i]-p[r]).y<<endl;
        //cout<<(p[l]-p[r])*(p[i]-p[r])<<endl;
        if((p[l]-p[r])*(p[i]-p[r])>0)
        {
            dp[l][r]=(dp[l][r]+dfs(l,i)*dfs(i,r))%M;
        }
    }
    return dp[l][r];
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++) cin>>p[i].x>>p[i].y;
    long long temp=0;
    for(int i=2;i<n;i++) temp+=(p[i-1]-p[0])*(p[i]-p[0]);
    if(temp<0)
    {
        //cout<<"<0"<<endl;
        for(int i=0; i<n/2; i++) swap(p[i],p[n-i-1]);
    }
    memset(dp,0,sizeof(dp));
    cout<<dfs(0,n-1)<<endl;
    return 0;
}


#include <iostream>
#include <cstring>
using namespace std;
int n,dp[205][205],M=1e9+7;
struct point
{
    long long x,y;
    struct point operator -(struct point A)
    {
        struct point t;
        t.x=x-A.x;
        t.y=y-A.y;
        return t;
    };
    long long  operator *(struct point A)
    {
        return x*A.y-y*A.x;
    }
} p[205];
long long dfs(int l,int r)
{
    //cout<<l<<" * "<<r<<endl;
    if(dp[l][r]) return dp[l][r];
    if(r-l==1) return 1;
    for(int i=l+1; i<r; i++)
    {
        if((p[l]-p[r])*(p[i]-p[r])>0)
            dp[l][r]=(dp[l][r]+dfs(l,i)*dfs(i,r))%M;
    }
    return dp[l][r];
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++) cin>>p[i].x>>p[i].y;
    //if((p[1]-p[0])*(p[2]-p[0])<0)
    memset(dp,0,sizeof(dp));
    long long  ans= dfs(0,n-1);
    for(int i=0; i<n/2; i++) swap(p[i],p[n-i-1]);
    memset(dp,0,sizeof(dp));
    cout<<max(ans,dfs(0,n-1))<<endl;
    return 0;
}


#include <iostream>
#include <cstring>
using namespace std;
int n,dp[205][205],M=1e9+7;
struct point
{
    long long x,y;
    struct point operator -(struct point A)
    {
        struct point t;
        t.x=x-A.x;
        t.y=y-A.y;
        return t;
    };
    long long  operator *(struct point A)
    {
        return x*A.y-y*A.x;
    }
} p[205];
long long dfs(int l,int r)
{
    //cout<<l<<" * "<<r<<endl;
    if(dp[l][r]) return dp[l][r];
    if(r-l<=1) return 1;
    for(int i=l+1; i<r; i++)
    {
        if((p[l]-p[r])*(p[i]-p[r])>0)
            dp[l][r]=(dp[l][r]+dfs(l,i)*dfs(i,r))%M;
    }
    return dp[l][r];
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++) cin>>p[i].x>>p[i].y;
    long long temp=0;
    for(int i=1;i<n;i++) temp+=p[i]*p[i-1];
    if(temp<0) for(int i=0; i<n/2; i++) swap(p[i],p[n-i-1]);
    memset(dp,0,sizeof(dp));
    cout<<dfs(0,n-1)<<endl;
    return 0;
}


#include <iostream>
#include <cstring>
using namespace std;
int n,dp[205][205],M=1e9+7;
struct point
{
    long long x,y;
    struct point operator -(struct point A)
    {
        struct point t;
        t.x=x-A.x;
        t.y=y-A.y;
        return t;
    };
    long long  operator *(struct point A)
    {
        return x*A.y-y*A.x;
    }
} p[205];
long long dfs(int l,int r)
{
    //cout<<l<<" * "<<r<<endl;
    if(dp[l][r]!=-1) return dp[l][r]; //cout<<"**************"<<endl;
    if(r-l<=1) return dp[l][r]=1;
    dp[l][r]=0;
    for(int i=l+1; i<r; i++)
    {
       // cout<<(p[l]-p[r]).x<<" "<<(p[l]-p[r]).y<<endl;
        //cout<<(p[i]-p[r]).x<<" "<<(p[i]-p[r]).y<<endl;
        //cout<<(p[l]-p[r])*(p[i]-p[r])<<endl;
        if((p[l]-p[r])*(p[i]-p[r])>0)
        {
            dp[l][r]=(dp[l][r]+dfs(l,i)*dfs(i,r))%M;
        }
    }
    return dp[l][r];
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++) cin>>p[i].x>>p[i].y;
    long long temp=0;
    for(int i=2;i<n;i++) temp+=(p[i-1]-p[0])*(p[i]-p[0]);
    if(temp<0)
    {
        //cout<<"<0"<<endl;
        for(int i=0; i<n/2; i++) swap(p[i],p[n-i-1]);
    }
    memset(dp,-1,sizeof(dp));
    cout<<dfs(0,n-1)<<endl;
    return 0;
}


#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N=205,mod=1000000007;
int n,f[N][N];
long long s;
bool vis[N][N];
struct point{
	long long x,y;
	point(){x=y=0;}
	point(long long x,long long y):x(x),y(y){}
	void in(){
		scanf("%lld%lld",&x,&y);
	}
	point operator + (const point &n) const{
		return point(x+n.x,y+n.y);
	}
	point operator - (const point &n) const{
		return point(x-n.x,y-n.y);
	}
	long long cross(const point &n){
		return x*n.y-y*n.x;
	}
}a[N];
int dp(int l,int r){
	if(vis[l][r]){
		return f[l][r];
	}
	if(r-l==1){
		return 1;
	}
	for(int i=l+1;i<r;i++){
		if((a[i]-a[l]).cross(a[r]-a[l])>0){
			f[l][r]=(f[l][r]+1LL*dp(l,i)*dp(i,r))%mod;
		}
	}
	vis[l][r]=true;
	return f[l][r];
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		a[i].in();
	}
	for(int i=2;i<n;i++){
		s+=(a[i]-a[1]).cross(a[i+1]-a[1]);
	}
	if(s<0){
		reverse(a+1,a+n+1);
	}
	printf("%d\n",dp(1,n));
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i,a,b) for(register sign i=(sign)(a);i<=(sign)(b);++i)
#define Fordown(i,a,b) for(register sign i=(sign)(a);i>=(sign)(b);--i)
const int N=200+5;
template<typename T>bool cmax(T &a,T b){return (a<b)?a=b,1:0;}
template<typename T>bool cmin(T &a,T b){return (a>b)?a=b,1:0;}
template<typename T>T read()
{
	T ans=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)&&ch!='-')ch=getchar();
	if(ch=='-')f=-1,ch=getchar();
	while(isdigit(ch))ans=(ans<<3)+(ans<<1)+(ch-'0'),ch=getchar();
	return ans*f;
}
template<typename T>void write(T x,char y)
{
	if(x==0)
	{
		putchar('0'),putchar(y);
		return;
	}
	if(x<0)
	{
		putchar('-');
		x=-x;
	}
	static char wr[20];
	int top=0;
	for(;x;x/=10)wr[++top]=x%10+'0';
	while(top)putchar(wr[top--]);
	putchar(y);
}
void file()
{
#ifndef ONLINE_JUDGE
	freopen("in","r",stdin);
	freopen("out","w",stdout);
#endif
}
struct node
{
	int x,y;
	node operator - (const node b)const
	{
		return (node){x-b.x,y-b.y};
	}
	ll operator * (const node b)const
	{
		return 1ll*x*b.y-1ll*b.x*y;
	}
}e[N];
int n;
void input()
{
	n=read<int>();
	For(i,0,n-1)e[i].x=read<int>(),e[i].y=read<int>();
}
const int mo=1e9+7;
int dp[N][N];
int DP(int l,int r)
{
	if(dp[l][r]!=-1)return dp[l][r];
	if(l+1==r)return dp[l][r]=1;
	int res=0;
	For(mid,l+1,r-1)
	{
		if((e[mid]-e[l])*(e[r]-e[l])>0)
			res=(res+1ll*DP(l,mid)*DP(mid,r)%mo)%mo;
	}
//	cout<<l<<' '<<r<<' '<<res<<endl;
	return dp[l][r]=res;
}
void work()
{
	memset(dp,-1,sizeof dp);
	ll s=0;
	For(i,0,n-1)s+=e[i]*e[(i+1)%n];
	if(s<0)reverse(e,e+n);
	write(DP(0,n-1),'\n');
}
int main()
{
	file();
	input();
	work();
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i,a,b) for(register sign i=(sign)(a);i<=(sign)(b);++i)
#define Fordown(i,a,b) for(register sign i=(sign)(a);i>=(sign)(b);--i)
const int N=200+5;
template<typename T>bool cmax(T &a,T b){return (a<b)?a=b,1:0;}
template<typename T>bool cmin(T &a,T b){return (a>b)?a=b,1:0;}
template<typename T>T read()
{
	T ans=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)&&ch!='-')ch=getchar();
	if(ch=='-')f=-1,ch=getchar();
	while(isdigit(ch))ans=(ans<<3)+(ans<<1)+(ch-'0'),ch=getchar();
	return ans*f;
}
template<typename T>void write(T x,char y)
{
	if(x==0)
	{
		putchar('0'),putchar(y);
		return;
	}
	if(x<0)
	{
		putchar('-');
		x=-x;
	}
	static char wr[20];
	int top=0;
	for(;x;x/=10)wr[++top]=x%10+'0';
	while(top)putchar(wr[top--]);
	putchar(y);
}
void file()
{
#ifndef ONLINE_JUDGE
	freopen("in","r",stdin);
	freopen("out","w",stdout);
#endif
}
struct node
{
	int x,y;
	node operator - (const node b)const
	{
		return (node){x-b.x,y-b.y};
	}
	ll operator * (const node b)const
	{
		return 1ll*x*b.y-1ll*b.x*y;
	}
}e[N];
int n;
void input()
{
	n=read<int>();
	For(i,0,n-1)e[i].x=read<int>(),e[i].y=read<int>();
}
const int mo=1e9+7;
int dp[N][N];
int DP(int l,int r)
{
	if(dp[l][r]!=-1)return dp[l][r];
	if(l+1==r)return dp[l][r]=1;
	int res=0;
	For(mid,l+1,r-1)
	{
		if((e[l]-e[mid])*(e[r]-e[mid])>0)
			res=(res+1ll*DP(l,mid)*DP(mid,r)%mo)%mo;
	}
//	cout<<l<<' '<<r<<' '<<res<<endl;
	return dp[l][r]=res;
}
void work()
{
	memset(dp,-1,sizeof dp);
	ll s=0;
	For(i,0,n-1)s+=(e[(i+2)%n]-e[i])*(e[(i+1)%n]-e[i]);
	if(s<0)reverse(e,e+n);
	write(DP(0,n-1),'\n');
}
int main()
{
	file();
	input();
	work();
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i,a,b) for(register sign i=(sign)(a);i<=(sign)(b);++i)
#define Fordown(i,a,b) for(register sign i=(sign)(a);i>=(sign)(b);--i)
const int N=200+5;
template<typename T>bool cmax(T &a,T b){return (a<b)?a=b,1:0;}
template<typename T>bool cmin(T &a,T b){return (a>b)?a=b,1:0;}
template<typename T>T read()
{
	T ans=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)&&ch!='-')ch=getchar();
	if(ch=='-')f=-1,ch=getchar();
	while(isdigit(ch))ans=(ans<<3)+(ans<<1)+(ch-'0'),ch=getchar();
	return ans*f;
}
template<typename T>void write(T x,char y)
{
	if(x==0)
	{
		putchar('0'),putchar(y);
		return;
	}
	if(x<0)
	{
		putchar('-');
		x=-x;
	}
	static char wr[20];
	int top=0;
	for(;x;x/=10)wr[++top]=x%10+'0';
	while(top)putchar(wr[top--]);
	putchar(y);
}
void file()
{
#ifndef ONLINE_JUDGE
	freopen("in","r",stdin);
	freopen("out","w",stdout);
#endif
}
struct node
{
	int x,y;
	node operator - (const node b)const
	{
		return (node){x-b.x,y-b.y};
	}
	ll operator * (const node b)const
	{
		return 1ll*x*b.y-1ll*b.x*y;
	}
}e[N];
int n;
void input()
{
	n=read<int>();
	For(i,0,n-1)e[i].x=read<int>(),e[i].y=read<int>();
}
const int mo=1e9+7;
int dp[N][N];
int DP(int l,int r)
{
	if(dp[l][r]!=-1)return dp[l][r];
	if(l+1==r)return dp[l][r]=1;
	int res=0;
	For(mid,l+1,r-1)
	{
		if((e[mid]-e[l])*(e[r]-e[l])<0)
			res=(res+1ll*DP(l,mid)*DP(mid,r)%mo)%mo;
	}
//	cout<<l<<' '<<r<<' '<<res<<endl;
	return dp[l][r]=res;
}
void work()
{
	memset(dp,-1,sizeof dp);
	ll s=0;
	For(i,0,n-1)s+=(e[(i+2)%n]-e[i])*(e[(i+1)%n]-e[i]);
	if(s<0)reverse(e,e+n);
	write(DP(0,n-1),'\n');
}
int main()
{
	file();
	input();
	work();
	return 0;
}


#include<algorithm>
#include<cstdio>
#define MaxN 205
#define db double
using namespace std;
const int mod=1000000007;
struct Point{
  db x,y;
  Point operator - (const Point &B) const
  {return (Point){x-B.x,y-B.y};}
  db operator ^ (const Point &B) const
  {return x*B.y-y*B.x;}
}p[MaxN];
int f[MaxN][MaxN];
int dfs(int l,int r)
{
  if (l+1==r)return 1;
  if (f[l][r]!=-1)return f[l][r];
  int ans=0;
  for (int k=l+1;k<r;k++)
    if (((p[k]-p[l])^(p[r]-p[l]))>1e-10)
      ans=(ans+1ll*dfs(l,k)*dfs(k,r))%mod;
  return f[l][r]=ans;
}
int n;
int main()
{
  scanf("%d",&n);
  for (int i=1;i<=n;i++)
     for (int j=i;j<=n;j++)
       f[i][j]=-1;
  for (int i=1;i<=n;i++)
    scanf("%lf%lf",&p[i].x,&p[i].y);
  db ans=p[n]^p[1];
  for (int i=1;i<n;i++)
    ans+=p[i]^p[i+1];
  if (ans<0.0)reverse(p+1,p+n+1);
  printf("%.3lf\n",ans);
  printf("%d",dfs(1,n));
  return 0;
}


#include<algorithm>
#include<cstdio>
#define MaxN 205
#define db double
using namespace std;
const db eps=1e-8;
const int mod=1000000007;
int sign(db x)
{return x<eps ? (-eps<x ? 0 : -1 ) : 1;}
struct Point{
  db x,y;
  Point operator - (const Point &B) const
  {return (Point){x-B.x,y-B.y};}
  db operator ^ (const Point &B) const
  {return x*B.y-y*B.x;}
}p[MaxN];
int f[MaxN][MaxN];
int dfs(int l,int r)
{
  if (l+1==r)return 1;
  if (f[l][r]!=-1)return f[l][r];
  int ans=0;
  for (int k=l+1;k<r;k++)
    if (sign((p[k]-p[l])^(p[r]-p[l]))==1)
    ans=(ans+1ll*dfs(l,k)*dfs(k,r))%mod;
  return f[l][r]=ans;
}
int n;
int main()
{
  scanf("%d",&n);
  for (int i=1;i<=n;i++)
     for (int j=i;j<=n;j++)
       f[i][j]=-1;
  for (int i=1;i<=n;i++)
    scanf("%lf%lf",&p[i].x,&p[i].y);
  db ans=p[1]^p[n];
  for (int i=1;i<n;i++)
    ans+=p[i]^p[i+1];
  if (ans<0)reverse(p+1,p+n+1);
  printf("%d",dfs(1,n));
  return 0;
}


#include<algorithm>
#include<cstdio>
#define MaxN 205
#define db double
using namespace std;
const int mod=1000000007;
struct Point{
  db x,y;
  Point operator - (const Point &B) const
  {return (Point){x-B.x,y-B.y};}
  db operator ^ (const Point &B) const
  {return x*B.y-y*B.x;}
}p[MaxN];
int f[MaxN][MaxN];
int dfs(int l,int r)
{
  if (l+1==r)return 1;
  if (f[l][r]!=-1)return f[l][r];
  int ans=0;
  for (int k=l+1;k<r;k++)
    if (((p[k]-p[l])^(p[r]-p[l]))>1e-10)
      ans=(ans+1ll*dfs(l,k)*dfs(k,r))%mod;
  return f[l][r]=ans;
}
int n;
int main()
{
  scanf("%d",&n);
  for (int i=1;i<=n;i++)
     for (int j=i;j<=n;j++)
       f[i][j]=-1;
  for (int i=1;i<=n;i++)
    scanf("%lf%lf",&p[i].x,&p[i].y);
  db ans=p[n]^p[1];
  for (int i=1;i<n;i++)
    ans+=p[i]^p[i+1];
  if (ans<0.0)reverse(p+1,p+n+1);
  printf("%d",dfs(1,n));
  return 0;
}


#include<bits/stdc++.h>
#define N 2005
using namespace std;
int n,dp[N][N];
struct node{int x,y;}a[N];
int operator * (node aa,node bb){return aa.x*bb.y-aa.y*bb.x;}
node operator - (node aa,node bb){return (node){aa.x-bb.x,aa.y-bb.y};}
int solve(int l,int r){
	if (dp[l][r]!=-1) return dp[l][r];
	int &ans=dp[l][r];ans=0;
	if (r-l==1) return ans=1;
	for (int i=l+1;i<r;i++)
		if ((a[l]-a[r])*(a[i]-a[r])>0) ans+=solve(l,i)*solve(i,r);
	return ans;
}
int main(){
	scanf("%d",&n);
	memset(dp,-1,sizeof(dp));
	for (int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].y);
	int sum=0;a[n+1]=a[1];
	for (int i=1;i<=n;i++) sum+=a[i]*a[i+1];
	if (sum<0) reverse(a+1,a+n+1);
	printf("%d\n",solve(1,n));
	return 0;
}


#include<bits/stdc++.h>
#define Mod 1000000007
#define N 2005
using namespace std;
int n,dp[N][N];
struct node{int x,y;}a[N];
int operator * (node aa,node bb){return aa.x*bb.y-aa.y*bb.x;}
node operator - (node aa,node bb){return (node){aa.x-bb.x,aa.y-bb.y};}
int solve(int l,int r){
	if (dp[l][r]!=-1) return dp[l][r];
	int &ans=dp[l][r];ans=0;
	if (r-l==1) return ans=1;
	for (int i=l+1;i<r;i++)
		if ((a[l]-a[r])*(a[i]-a[r])>0) ans=(ans+1ll*solve(l,i)*solve(i,r)%Mod)%Mod;
	return ans;
}
int main(){
	scanf("%d",&n);
	memset(dp,-1,sizeof(dp));
	for (int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].y);
	long long sum=0;a[n+1]=a[1];
	for (int i=1;i<=n;i++) sum+=1ll*(a[i]*a[i+1]);
	if (sum<0) reverse(a+1,a+n+1);
	printf("%d\n",solve(1,n));
	return 0;
}


#include<bits/stdc++.h>
#define Mod 1000000007
#define N 2005
using namespace std;
int n,dp[N][N];
struct node{int x,y;}a[N];
int operator * (node aa,node bb){return aa.x*bb.y-aa.y*bb.x;}
node operator - (node aa,node bb){return (node){aa.x-bb.x,aa.y-bb.y};}
int solve(int l,int r){
	if (dp[l][r]!=-1) return dp[l][r];
	int &ans=dp[l][r];ans=0;
	if (r-l==1) return ans=1;
	for (int i=l+1;i<r;i++)
		if ((a[l]-a[r])*(a[i]-a[r])>0) ans=(ans+1ll*solve(l,i)*solve(i,r)%Mod)%Mod;
	return ans;
}
int main(){
	scanf("%d",&n);
	memset(dp,-1,sizeof(dp));
	for (int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].y);
	int sum=0;a[n+1]=a[1];
	for (int i=1;i<=n;i++) sum+=a[i]*a[i+1];
	if (sum<0) reverse(a+1,a+n+1);
	printf("%d\n",solve(1,n));
	return 0;
}


#include<bits/stdc++.h>
#define Mod 1000000007
#define int long long
#define N 2005
using namespace std;
int n,dp[N][N];
struct node{int x,y;}a[N];
int operator * (node aa,node bb){return aa.x*bb.y-aa.y*bb.x;}
node operator - (node aa,node bb){return (node){aa.x-bb.x,aa.y-bb.y};}
int solve(int l,int r){
	if (dp[l][r]!=-1) return dp[l][r];
	int &ans=dp[l][r];ans=0;
	if (r-l==1) return ans=1;
	for (int i=l+1;i<r;i++)
		if ((a[l]-a[r])*(a[i]-a[r])>0) ans=(ans+1ll*solve(l,i)*solve(i,r)%Mod)%Mod;
	return ans;
}
signed main(){
	scanf("%lld",&n);
	memset(dp,-1,sizeof(dp));
	for (int i=1;i<=n;i++) scanf("%lld%lld",&a[i].x,&a[i].y);
	int sum=0;a[n+1]=a[1];
	for (int i=1;i<=n;i++) sum+=a[i]*a[i+1];
	if (sum<0) reverse(a+1,a+n+1);
	printf("%lld\n",solve(1,n));
	return 0;
}


#include<bits/stdc++.h>
#define Mod 1000000007
#define N 2005
using namespace std;
int n,dp[N][N];
struct node{int x,y;}a[N];
int operator * (node aa,node bb){return aa.x*bb.y-aa.y*bb.x;}
node operator - (node aa,node bb){return (node){aa.x-bb.x,aa.y-bb.y};}
int solve(int l,int r){
	if (dp[l][r]!=-1) return dp[l][r];
	int &ans=dp[l][r];ans=0;
	if (r-l==1) return ans=1;
	for (int i=l+1;i<r;i++)
		if ((a[l]-a[r])*(a[i]-a[r])>0) ans=(ans+1ll*solve(l,i)*solve(i,r)%Mod)%Mod;
	return ans;
}
int main(){
	scanf("%d",&n);
	memset(dp,-1,sizeof(dp));
	for (int i=1;i<=n;i++) scanf("%d%d",&a[i].x,&a[i].y);
	long long sum=0;a[n+1]=a[1];
	for (int i=1;i<=n;i++) sum+=1ll*a[i]*a[i+1];
	if (sum<0) reverse(a+1,a+n+1);
	printf("%d\n",solve(1,n));
	return 0;
}


#include<stdio.h>
#include<assert.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<queue>
#include<iostream>
#include<cmath>
using namespace std;

#define FRE(i,a,b)  for(i = a; i <= b; i++)
#define FRL(i,a,b)  for(i = a; i < b; i++)
#define mem(t, v)   memset ((t) , v, sizeof(t))
#define all(x)      x.begin(),x.end()
#define un(x)       x.erase(unique(all(x)), x.end())
#define sf(n)       scanf("%d", &n)
#define sff(a,b)    scanf("%d %d", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define D(x)        cout<<#x " = "<<(x)<<endl
#define DBG         pf("Hi\n")
#define pf          printf
#define pii         pair <int, int>
#define pll         pair <LL, LL>
#define pb          push_back
#define PI          acos(-1.00)
#define sz          size()
#define xx          first
#define yy          second
#define eps         1e-6
#define MAX         50
#define MOD         1000000007
typedef long long int LL;
typedef double db;
struct point {
    LL x, y;
}A[55];
const LL inf = 1000000000000000LL;
LL dp[55][55], total;
bool F[55][55];
int n;
LL mabs(LL a)
{
    if(a < 0)
        a *= -1;
    return a;
}
void Assert(bool nw)
{
    if(nw == false) while(1);
}
LL area( point p0, point p1, point p2) {
	LL ret = 0;
	point P[3] = {p0,p1,p2};
	int n = 3;
	for( int i = 0, j = n - 1; i < n; j = i++ ) ret += P[j].x * P[i].y - P[j].y * P[i].x;
	return mabs(ret);
}

LL areaPolygon( point P[], int n ) {
	LL area = 0;
	for( int i = 0, j = n - 1; i < n; j = i++ ) area += P[j].x * P[i].y - P[j].y * P[i].x;
	return mabs(area);
}

LL call(int st, int ed)
{
    //D(st);D(ed);getchar();
    Assert(st != ed);
    if(st == ed-1)
        return 1;
    if(F[st][ed] == false)
    {
        //D(st);D(ed);
        return 0;
    }
    //if(st == ed-2)
  //      return area(A[st],A[st+1],A[ed]);
    if(dp[st][ed] != -1)
        return dp[st][ed];
    LL ret = 0;
    for(int i = st+1; i<ed; i++)
    {
        if(!area(A[st],A[i],A[ed]))
            continue;
        ret += (call(st,i)*call(i,ed))%MOD;
        ret %= MOD;
    }
    //Assert(ret != inf);
    //Assert(ret);
    return dp[st][ed] = ret;
}
bool valid(int a, int b)
{
    point p1[60], p2[60];
    int cnt = 0;
    for(int i = a; i<=b; i++)
        p1[cnt++] = A[i];
    LL sum = areaPolygon(p1, cnt);
    cnt = 0;
   // D(n);
    int i = b;
    while(true)
    {
        p2[cnt++] = A[i];
        i++;
        if(i == n)
            i = 0;
        if(i == (a+1))
            break;
    }

    sum += areaPolygon(p2, cnt);
   // D(sum);D(total);
    return (sum == total);
}
int main()
{
   // Assert(false);
    int i, j, k, cs, t;
    t = 1;
    FRE(cs,1,t)
    {
        mem(dp,-1);
        sf(n);
        FRL(i,0,n)
            scanf("%lld %lld",&A[i].x,&A[i].y);
        total = areaPolygon(A,n);
        for(i = 0; i<n; i++)
        {
            for(j = i+1; j<n;j++)
            {
                F[i][j] = F[j][i] = valid(i,j);
         //       D(F[i][j]);D(i);D(j);cout << endl; getchar();
            }
        }
        pf("%lld\n",call(0,n-1));
    }
    return 0;
}


#include<stdio.h>
#include<assert.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<queue>
#include<iostream>
#include<cmath>
using namespace std;

#define FRE(i,a,b)  for(i = a; i <= b; i++)
#define FRL(i,a,b)  for(i = a; i < b; i++)
#define mem(t, v)   memset ((t) , v, sizeof(t))
#define all(x)      x.begin(),x.end()
#define un(x)       x.erase(unique(all(x)), x.end())
#define sf(n)       scanf("%d", &n)
#define sff(a,b)    scanf("%d %d", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define D(x)        cout<<#x " = "<<(x)<<endl
#define DBG         pf("Hi\n")
#define pf          printf
#define pii         point
#define pll         pair <LL, LL>
#define pb          push_back
#define PI          acos(-1.00)
#define sz          size()
#define xx          x
#define yy          y
#define eps         1e-6
#define MAX         200
#define MOD         1000000007
typedef long long int LL;
typedef double db;
struct point {
    LL x, y;
}A[MAX+5];
const LL inf = 1000000000000000LL;
LL dp[MAX+5][MAX+5], total;
bool F[MAX+5][MAX+5];
int n;
LL mabs(LL a)
{
    if(a < 0)
        a *= -1;
    return a;
}
void Assert(bool nw)
{
    if(nw == false) while(1);
}
LL area( point p0, point p1, point p2) {
	LL ret = 0;
	point P[3] = {p0,p1,p2};
	int n = 3;
	for( int i = 0, j = n - 1; i < n; j = i++ ) ret += P[j].x * P[i].y - P[j].y * P[i].x;
	return mabs(ret);
}

LL areaPolygon( point P[], int n ) {
	LL area = 0;
	for( int i = 0, j = n - 1; i < n; j = i++ ) area += P[j].x * P[i].y - P[j].y * P[i].x;
	return mabs(area);
}

LL call(int st, int ed)
{
    //D(st);D(ed);getchar();
    Assert(st != ed);
    if(st == ed-1)
        return 1;
    if(F[st][ed] == false)
    {
        //D(st);D(ed);
        return 0;
    }
    if(st == ed-2)
        return (area(A[st],A[st+1],A[ed])!=0);
    if(dp[st][ed] != -1)
        return dp[st][ed];
    LL ret = 0;
    for(int i = st+1; i<ed; i++)
    {
        if(!area(A[st],A[i],A[ed]))
            continue;
        ret += (call(st,i)*call(i,ed))%MOD;
        ret %= MOD;
    }
    //Assert(ret != inf);
    //Assert(ret);
    return dp[st][ed] = ret;
}

///Segment Segment Intersection (2D)
int order(pii l, pii r, pii mid) // (l___r) -> mid
{
    LL ret = 0;
    ret += (LL) l.xx*r.yy + (LL) r.xx*mid.yy + (LL) mid.xx*l.yy - (LL) l.xx*mid.yy - (LL) mid.xx*r.yy - (LL) r.xx*l.yy;
    if(ret < 0) return -1;
    if(ret > 0) return +1;
    return 0;
}

bool onsegment(pii l, pii r, pii mid) // (l___r) -> mid
{
    if(order(l,r,mid)) return 0;
    return (min(l.xx,r.xx) <= mid.xx && mid.xx <= max(l.xx,r.xx) && min(l.yy,r.yy) <= mid.yy && mid.yy <= max(l.yy,r.yy));
}

inline bool intersect(pii p1, pii p2, pii p3, pii p4)
{
    int d1, d2, d3, d4;
    d1 = order(p3, p4, p1);
    d2 = order(p3, p4, p2);
    d3 = order(p1, p2, p3);
    d4 = order(p1, p2, p4);
    if(((d1 < 0 && d2 > 0) || (d1 > 0 && d2 < 0)) && ((d3 < 0 && d4 > 0) || (d3 > 0 && d4 < 0))) return true;
    if(!d3 && onsegment(p1, p2, p3)) return true;
    if(!d4 && onsegment(p1, p2, p4)) return true;
    if(!d1 && onsegment(p3, p4, p1)) return true;
    if(!d2 && onsegment(p3, p4, p2)) return true;
    return false;
}
bool go(int a, int b)
{
    int j;
    for(int i = 0; i<n; i++)
    {
        j = i+1;
        j%=n;
        if(i == a || i == b || j == a || j == b)
            continue;
        if(intersect(A[a],A[b],A[i],A[j]))
            return false;
    }
    return true;
}
bool valid(int a, int b)
{
    point p1[MAX+5], p2[MAX+5];
    int cnt = 0;
    for(int i = a; i<=b; i++)
        p1[cnt++] = A[i];
    LL sum = areaPolygon(p1, cnt);
    cnt = 0;
   // D(n);
    int i = b;
    while(true)
    {
        p2[cnt++] = A[i];
        i++;
        if(i == n)
            i = 0;
        if(i == (a+1))
            break;
    }

    sum += areaPolygon(p2, cnt);
   // D(sum);D(total);
    return  go(a,b);
}
int main()
{
   // Assert(false);
    int i, j, k, cs, t;
    t = 1;
    FRE(cs,1,t)
    {
        mem(dp,-1);
        sf(n);
        FRL(i,0,n)
            scanf("%lld %lld",&A[i].x,&A[i].y);
        total = areaPolygon(A,n);
        for(i = 0; i<n; i++)
        {
            for(j = i+1; j<n;j++)
            {
                F[i][j] = F[j][i] = valid(i,j);
         //       D(F[i][j]);D(i);D(j);cout << endl; getchar();
            }
        }
        pf("%lld\n",call(0,n-1));
    }
    return 0;
}


#include<stdio.h>
#include<assert.h>
#include<algorithm>
#include<string.h>
#include<vector>
#include<queue>
#include<iostream>
#include<cmath>
using namespace std;

#define FRE(i,a,b)  for(i = a; i <= b; i++)
#define FRL(i,a,b)  for(i = a; i < b; i++)
#define mem(t, v)   memset ((t) , v, sizeof(t))
#define all(x)      x.begin(),x.end()
#define un(x)       x.erase(unique(all(x)), x.end())
#define sf(n)       scanf("%d", &n)
#define sff(a,b)    scanf("%d %d", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define D(x)        cout<<#x " = "<<(x)<<endl
#define DBG         pf("Hi\n")
#define pf          printf
#define pii         point
#define pll         pair <LL, LL>
#define pb          push_back
#define PI          acos(-1.00)
#define sz          size()
#define xx          x
#define yy          y
#define eps         1e-6
#define MAX         200
#define MOD         1000000007
typedef long long int LL;
typedef double db;
struct point {
    LL x, y;
}A[MAX+5];
const LL inf = 1000000000000000LL;
LL dp[MAX+5][MAX+5], total;
bool F[MAX+5][MAX+5];
int n;
LL mabs(LL a)
{
    if(a < 0)
        a *= -1;
    return a;
}
void Assert(bool nw)
{
    if(nw == false) while(1);
}
LL area( point p0, point p1, point p2) {
	LL ret = 0;
	point P[3] = {p0,p1,p2};
	int n = 3;
	for( int i = 0, j = n - 1; i < n; j = i++ ) ret += P[j].x * P[i].y - P[j].y * P[i].x;
	return mabs(ret);
}

LL areaPolygon( point P[], int n ) {
	LL area = 0;
	for( int i = 0, j = n - 1; i < n; j = i++ ) area += P[j].x * P[i].y - P[j].y * P[i].x;
	return mabs(area);
}

LL call(int st, int ed)
{
    //D(st);D(ed);getchar();
    Assert(st != ed);
    if(st == ed-1)
        return 1;
    if(F[st][ed] == false)
    {
        //D(st);D(ed);
        return 0;
    }
    if(st == ed-2)
        return (area(A[st],A[st+1],A[ed])!=0);
    if(dp[st][ed] != -1)
        return dp[st][ed];
    LL ret = 0;
    for(int i = st+1; i<ed; i++)
    {
        if(!area(A[st],A[i],A[ed]))
            continue;
        ret += (call(st,i)*call(i,ed))%MOD;
        ret %= MOD;
    }
    //Assert(ret != inf);
    //Assert(ret);
    return dp[st][ed] = ret;
}

///Segment Segment Intersection (2D)
int order(pii l, pii r, pii mid) // (l___r) -> mid
{
    LL ret = 0;
    ret += (LL) l.xx*r.yy + (LL) r.xx*mid.yy + (LL) mid.xx*l.yy - (LL) l.xx*mid.yy - (LL) mid.xx*r.yy - (LL) r.xx*l.yy;
    if(ret < 0) return -1;
    if(ret > 0) return +1;
    return 0;
}

bool onsegment(pii l, pii r, pii mid) // (l___r) -> mid
{
    if(order(l,r,mid)) return 0;
    return (min(l.xx,r.xx) <= mid.xx && mid.xx <= max(l.xx,r.xx) && min(l.yy,r.yy) <= mid.yy && mid.yy <= max(l.yy,r.yy));
}

inline bool intersect(pii p1, pii p2, pii p3, pii p4)
{
    int d1, d2, d3, d4;
    d1 = order(p3, p4, p1);
    d2 = order(p3, p4, p2);
    d3 = order(p1, p2, p3);
    d4 = order(p1, p2, p4);
    if(((d1 < 0 && d2 > 0) || (d1 > 0 && d2 < 0)) && ((d3 < 0 && d4 > 0) || (d3 > 0 && d4 < 0))) return true;
    if(!d3 && onsegment(p1, p2, p3)) return true;
    if(!d4 && onsegment(p1, p2, p4)) return true;
    if(!d1 && onsegment(p3, p4, p1)) return true;
    if(!d2 && onsegment(p3, p4, p2)) return true;
    return false;
}
bool go(int a, int b)
{
    int j;
    for(int i = 0; i<n; i++)
    {
        j = i+1;
        j%=n;
        if(i == a || i == b || j == a || j == b)
            continue;
        if(intersect(A[a],A[b],A[i],A[j]))
            return false;
    }
    return true;
}
bool valid(int a, int b)
{
    point p1[MAX+5], p2[MAX+5];
    int cnt = 0;
    for(int i = a; i<=b; i++)
        p1[cnt++] = A[i];
    LL sum = areaPolygon(p1, cnt);
    cnt = 0;
   // D(n);
    int i = b;
    while(true)
    {
        p2[cnt++] = A[i];
        i++;
        if(i == n)
            i = 0;
        if(i == (a+1))
            break;
    }

    sum += areaPolygon(p2, cnt);
   // D(sum);D(total);
    return (sum == total && go(a,b));
}
int main()
{
   // Assert(false);
    int i, j, k, cs, t;
    t = 1;
    FRE(cs,1,t)
    {
        mem(dp,-1);
        sf(n);
        FRL(i,0,n)
            scanf("%lld %lld",&A[i].x,&A[i].y);
        total = areaPolygon(A,n);
        for(i = 0; i<n; i++)
        {
            for(j = i+1; j<n;j++)
            {
                F[i][j] = F[j][i] = valid(i,j);
         //       D(F[i][j]);D(i);D(j);cout << endl; getchar();
            }
        }
        pf("%lld\n",call(0,n-1));
    }
    return 0;
}


#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

const int maxn = 200+10;
typedef long long LL;
const int MOD = 1000*1000*1000+7;

struct Point
{
    int x,y;
    Point(int x = 0,int y = 0):x(x),y(y) {}
}p[maxn];
typedef Point Vector;
Vector operator - (const Point& a,const Point& b) { return Vector(a.x-b.x,a.y-b.y); }

LL cross(const Vector& a,const Vector& b) { return (LL)a.x*b.y-(LL)a.y*b.x; }

int d[maxn][maxn];
int n;

LL solve(int s,int e)
{
    int &ans = d[s][e];
    if(ans != -1) return ans;
    if(s+1 == e) return ans = 1;
    LL res = 0;
    for(int i = s+1;i < e;++i)
    {
        if(cross(p[s]-p[e],p[i]-p[e]) > 0)
            res = (res + solve(s,i)*solve(i,e)) % MOD;
    }
    return ans = res;
}

int main()
{
 //   freopen("./test.txt","r",stdin);
    scanf("%d",&n);
    for(int i = 0;i < n;++i)
        scanf("%d %d",&p[i].x,&p[i].y);
    LL judge = 0;
    for(int i = 0;i < n;++i)
        judge += cross(p[i],p[(i+1)%n]);
    if(judge < 0)
        reverse(p,p+n);
    memset(d,-1,sizeof(d));
    printf("%lld\n",solve(0,n-1));
    return 0;
}


#include<cstdio>
#include<algorithm>
using namespace std;
#define rep(i,a,n)for(int i=a;i<(int)n;i++)
const int N=210,mod=1000000007;
bool crs(int x1,int y1,int x2,int y2){return(1ll*x1*y2-1ll*x2*y1)>0;}
int dp[N][N];
int x[N],y[N],n;
int main(){
scanf("%d",&n);
rep(i,0,n)scanf("%d%d",x+i,y+i);
long long s=0;
rep(i,0,n)s+=1ll*x[i]*y[(i+1)%n]-1ll*y[i]*x[(i+1)%n];
if(s>0)reverse(x,x+n),reverse(y,y+n);
rep(d,1,n)rep(i,0,n-d){
int j=i+d;
if(d==1)dp[i][j]=1;
else rep(k,i+1,j)if(crs(x[k]-x[i],y[k]-y[i],x[k]-x[j],y[k]-y[j]))
dp[i][j]=(dp[i][j]+1ll*dp[i][k]*dp[k][j])%mod;
}
printf("%d\n",dp[0][n-1]);
}


#include <bits/stdc++.h>

using namespace std;

#define LL long long

const int MX = 200 + 23;
const LL MOD = 1e9 + 7;

struct VECTOR{
	LL x ,y;
	VECTOR(LL X = 0 ,LL Y = 0){x = X ,y = Y;}
	VECTOR operator +(const VECTOR &B)const{return VECTOR(x + B.x ,y + B.y);}
	VECTOR operator -(const VECTOR &B)const{return VECTOR(x - B.x ,y - B.y);}
	LL operator *(const VECTOR &B)const{return x * B.y - y * B.x;}
	bool operator ==(const VECTOR &B)const{return x == B.x && y == B.y;}
	void Read(){cin >> x >> y;}
}P[MX];

struct SEG{
	VECTOR st ,d;
	SEG(){st = d = VECTOR(0 ,0);}
	SEG(VECTOR __st ,VECTOR __ed){
		st = __st ,d = __ed - __st;
	};
	void turn(){
		st = st + d;
		d = VECTOR(0 ,0) - d;
	}
};

int sgn(LL x){
	if(!x) return 0;
	return x > 0 ? 1 : -1;
}

bool PingXing(VECTOR A ,VECTOR B){
	return A.x * B.y - A.y * B.x == 0;
}

bool online(SEG a ,VECTOR b){
	// 询问点 b 是否在 a 上（含边缘）
	bool xless = b.x < a.st.x && b.x < (a.st + a.d).x;
	bool xmore = b.x > a.st.x && b.x > (a.st + a.d).x;
	bool yless = b.y < a.st.y && b.y < (a.st + a.d).y;
	bool ymore = b.y > a.st.y && b.y > (a.st + a.d).y;
	return (xless + xmore + yless + ymore) == 0;
}

int ok(SEG a ,SEG b){
	// 0 绝对不行
	// 1 共点
	// 2 绝对可以
	LL test1 = sgn(a.d * (b.st - a.st)) * sgn(a.d * (b.st + b.d - a.st));
	LL test2 = sgn(b.d * (a.st - b.st)) * sgn(b.d * (a.st + a.d - b.st));
	if(test1 > 0 || test2 > 0){
		// 连交点都没有
		return 2;
	}
	if(PingXing(a.d ,b.d)){
		// 有交点且平行就是共线
		if(online(a ,b.st) || online(a ,b.st + b.d)
		|| online(b ,a.st) || online(b ,a.st + a.d)){
			// 二者有交
			if(sgn(a.d.x) != sgn(b.d.x) || sgn(a.d.y) != sgn(b.d.y)){
				b.turn();
			}
			if(a.st + a.d == b.st || b.st + b.d == a.st)
				return 1;
			return 0;
		}

		return 2;
	}
	return (test1 <= 0 && test2 <= 0);
}

LL fad;
int n;
int check(int l ,int r){

	SEG Main(P[l] ,P[r]);

	LL S = fad ,s1 = 0 ,s2 = 0;
	for(int i = l ; i <= r ; ++i){
		if(i == r){
			s1 += P[r] * P[l];
		}
		else{
			s1 += P[i] * P[i + 1];
		}
	}
	for(int i = r ; ; i = (i + 1) % n){
		if(i == l){
			s2 += P[l] * P[r];
			break;
		}
		s2 += P[i] * P[(i + 1) % n];
	}
	if(abs(S) != abs(s1) + abs(s2)) return 0;

	for(int i = 0 ; i < n ; ++i){
		SEG t(P[i] ,P[(i + 1) % n]);
		int judge = ok(Main ,t);
		if(i == r && ((i + 1) % n == l)) continue;
		if(judge == 0) return 0;
		if(judge == 1){
			if(i == l || (i + 1) % n == l || i == r || (i + 1) % n == r){
				continue;
			}
			return 0;
		}
	}
	return 1;
}

LL dp[MX][MX];

void test(){
	int n; cin >> n;
	while(n--){
		int x ,y;
		cin >> x >> y;
		printf("(%d,%d)\n" ,x ,y);
	}
	SEG a(VECTOR(1 ,0) ,VECTOR(-1 ,0)) ,b(VECTOR(0 ,0) ,VECTOR(1 ,0));
	cout << ok(a ,b) <<endl;
	return ;
}

int main(){
	// test();
	cin >> n;
	for(int i = 0 ; i < n ; ++i){
		P[i].Read();
	}
	for(int i = 0 ; i < n ; ++i){
		fad += P[i] * P[(i + 1) % n];
	}
	// fad 为正数说明是顺时针给出
	for(int i = 1 ; i < n ; ++i){
		dp[i - 1][i] = 1;
	}
	for(int len = 2 ; len <= n ; ++len){
		for(int st = 0 ; st + len < n ; ++st){
			int ed = st + len;
			if(!check(st ,ed)){
				continue;
			}
			for(int k = st + 1 ; k < ed ; ++k){
				dp[st][ed] = (dp[st][ed] + dp[st][k] * dp[k][ed]) % MOD;
			}
		}
	}
	cout << dp[0][n - 1] << endl;
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define LL long long

const int MX = 200 + 23;
const LL MOD = 1e9 + 7;

struct VECTOR{
	LL x ,y;
	VECTOR(LL X = 0 ,LL Y = 0){x = X ,y = Y;}
	VECTOR operator +(const VECTOR &B)const{return VECTOR(x + B.x ,y + B.y);}
	VECTOR operator -(const VECTOR &B)const{return VECTOR(x - B.x ,y - B.y);}
	LL operator *(const VECTOR &B)const{return x * B.y - y * B.x;}
	bool operator ==(const VECTOR &B)const{return x == B.x && y == B.y;}
	void Read(){cin >> x >> y;}
}P[MX];

struct SEG{
	VECTOR st ,d;
	SEG(){st = d = VECTOR(0 ,0);}
	SEG(VECTOR __st ,VECTOR __ed){
		st = __st ,d = __ed - __st;
	};
	void turn(){
		st = st + d;
		d = VECTOR(0 ,0) - d;
	}
};

int sgn(LL x){
	if(!x) return 0;
	return x > 0 ? 1 : -1;
}

bool PingXing(VECTOR A ,VECTOR B){
	return A.x * B.y - A.y * B.x == 0;
}

bool online(SEG a ,VECTOR b){
	// 询问点 b 是否在 a 上（含边缘）
	bool xless = b.x < a.st.x && b.x < (a.st + a.d).x;
	bool xmore = b.x > a.st.x && b.x > (a.st + a.d).x;
	bool yless = b.y < a.st.y && b.y < (a.st + a.d).y;
	bool ymore = b.y > a.st.y && b.y > (a.st + a.d).y;
	return xless + xmore + yless + ymore < 2;
}

int ok(SEG a ,SEG b){
	// 0 绝对不行
	// 1 共点
	// 2 绝对可以
	LL test1 = sgn(a.d * (b.st - a.st)) * sgn(a.d * (b.st + b.d - a.st));
	LL test2 = sgn(b.d * (a.st - b.st)) * sgn(b.d * (a.st + a.d - b.st));
	if(test1 > 0 || test2 > 0){
		// 连交点都没有
		return 2;
	}
	if(PingXing(a.d ,b.d)){
		// 有交点且平行就是共线
		if(online(a ,b.st) || online(a ,b.st + b.d)
		|| online(b ,a.st) || online(b ,a.st + a.d)){
			// 二者有交
			if(sgn(a.d.x) != sgn(b.d.x) || sgn(a.d.y) != sgn(b.d.y)){
				b.turn();
			}
			if(a.st + a.d == b.st || b.st + b.d == a.st)
				return 1;
			return 0;
		}

		return 2;
	}
	return (test1 <= 0 && test2 <= 0);
}

int n;
int check(int l ,int r){
	SEG Main(P[l] ,P[r]);

	int neg = 0 ,pos = 0;
	for(int i = 0 ; i < n ; ++i){
		if(i == l || i == r) continue;
		SEG now(P[l] ,P[i]);
		if(Main.d * now.d == 0) continue;
		if(Main.d * now.d > 0) ++pos;
		else ++neg;
	}
	if(!neg || !pos){
		if(r == (l + n - 1) % n){
			;
		}
		else return 0;
	}
	for(int i = 0 ; i < n ; ++i){
		SEG t(P[i] ,P[(i + 1) % n]);
		int judge = ok(Main ,t);
		if(i == r && ((i + 1) % n == l)) continue;
		if(judge == 0) return 0;
		if(judge == 1){
			if(i == l || (i + 1) % n == l || i == r || (i + 1) % n == r){
				continue;
			}
			return 0;
		}
	}
	return 1;
}

LL dp[MX][MX];

void test(){
	SEG a(VECTOR(1 ,0) ,VECTOR(-1 ,0)) ,b(VECTOR(0 ,0) ,VECTOR(1 ,0));
	cout << ok(a ,b) <<endl;
	return ;
}

int main(){
	// test();
	cin >> n;
	for(int i = 0 ; i < n ; ++i){
		P[i].Read();
	}
	for(int i = 1 ; i < n ; ++i){
		dp[i - 1][i] = 1;
	}
	for(int len = 2 ; len <= n ; ++len){
		for(int st = 0 ; st + len < n ; ++st){
			int ed = st + len;
			if(!check(st ,ed)){
		//		printf("[%d ,%d] is bad!\n" ,st ,ed);
				continue;
			}
			for(int k = st + 1 ; k < ed ; ++k){
				dp[st][ed] = (dp[st][ed] + dp[st][k] * dp[k][ed]) % MOD;
			}
		//	printf("dp[%d][%d] = %lld\n" ,st ,ed ,dp[st][ed]);
		}
	}
	cout << dp[0][n - 1] << endl;
	return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define LL long long

const int MX = 200 + 23;
const LL MOD = 1e9 + 7;

struct VECTOR{
	LL x ,y;
	VECTOR(LL X = 0 ,LL Y = 0){x = X ,y = Y;}
	VECTOR operator +(const VECTOR &B)const{return VECTOR(x + B.x ,y + B.y);}
	VECTOR operator -(const VECTOR &B)const{return VECTOR(x - B.x ,y - B.y);}
	LL operator *(const VECTOR &B)const{return x * B.y - y * B.x;}
	bool operator ==(const VECTOR &B)const{return x == B.x && y == B.y;}
	void Read(){cin >> x >> y;}
}P[MX];

struct SEG{
	VECTOR st ,d;
	SEG(){st = d = VECTOR(0 ,0);}
	SEG(VECTOR __st ,VECTOR __ed){
		st = __st ,d = __ed - __st;
	};
	void turn(){
		st = st + d;
		d = VECTOR(0 ,0) - d;
	}
};

int sgn(LL x){
	if(!x) return 0;
	return x > 0 ? 1 : -1;
}

bool PingXing(VECTOR A ,VECTOR B){
	return A.x * B.y - A.y * B.x == 0;
}

bool online(SEG a ,VECTOR b){
	// 询问点 b 是否在 a 上（含边缘）
	bool xless = b.x < a.st.x && b.x < (a.st + a.d).x;
	bool xmore = b.x > a.st.x && b.x > (a.st + a.d).x;
	bool yless = b.y < a.st.y && b.y < (a.st + a.d).y;
	bool ymore = b.y > a.st.y && b.y > (a.st + a.d).y;
	return (xless + xmore + yless + ymore) == 0;
}

int ok(SEG a ,SEG b){
	// 0 绝对不行
	// 1 共点
	// 2 绝对可以
	LL test1 = sgn(a.d * (b.st - a.st)) * sgn(a.d * (b.st + b.d - a.st));
	LL test2 = sgn(b.d * (a.st - b.st)) * sgn(b.d * (a.st + a.d - b.st));
	if(test1 > 0 || test2 > 0){
		// 连交点都没有
		return 2;
	}
	if(PingXing(a.d ,b.d)){
		// 有交点且平行就是共线
		if(online(a ,b.st) || online(a ,b.st + b.d)
		|| online(b ,a.st) || online(b ,a.st + a.d)){
			// 二者有交
			if(sgn(a.d.x) != sgn(b.d.x) || sgn(a.d.y) != sgn(b.d.y)){
				b.turn();
			}
			if(a.st + a.d == b.st || b.st + b.d == a.st)
				return 1;
			return 0;
		}

		return 2;
	}
	return (test1 <= 0 && test2 <= 0);
}

LL fad;
int n;
int check(int l ,int r){
	SEG Main(P[l] ,P[r]);
	if(fad > 0){
		if(Main.d * (P[l + 1] - P[l]) > 0){
			if(l == 0 && r == n - 1) ;
			else return 0;
		}
	}
	else{
		if(Main.d * (P[l + 1] - P[l]) < 0){
			if(l == 0 && r == n - 1) ;
			else return 0;
		}
	}
	int neg = 0 ,pos = 0;
	for(int i = 0 ; i < n ; ++i){
		if(i == l || i == r) continue;
		SEG now(P[l] ,P[i]);
		if(Main.d * now.d == 0) continue;
		if(Main.d * now.d > 0) ++pos;
		else ++neg;
	}
	if(!neg || !pos){
		if(r == (l + n - 1) % n){
			;
		}
		else return 0;
	}
	for(int i = 0 ; i < n ; ++i){
		SEG t(P[i] ,P[(i + 1) % n]);
		int judge = ok(Main ,t);
		if(i == r && ((i + 1) % n == l)) continue;
		if(judge == 0) return 0;
		if(judge == 1){
			if(i == l || (i + 1) % n == l || i == r || (i + 1) % n == r){
				continue;
			}
			return 0;
		}
	}
	return 1;
}

LL dp[MX][MX];

void test(){
	int n; cin >> n;
	while(n--){
		int x ,y;
		cin >> x >> y;
		printf("(%d,%d)\n" ,x ,y);
	}
	SEG a(VECTOR(1 ,0) ,VECTOR(-1 ,0)) ,b(VECTOR(0 ,0) ,VECTOR(1 ,0));
	cout << ok(a ,b) <<endl;
	return ;
}

int main(){
	// test();
	cin >> n;
	for(int i = 0 ; i < n ; ++i){
		P[i].Read();
	}
	for(int i = 0 ; i < n ; ++i){
		fad += P[i] * P[(i + 1) % n];
	}
	// fad 为正数说明是顺时针给出
	for(int i = 1 ; i < n ; ++i){
		dp[i - 1][i] = 1;
	}
	for(int len = 2 ; len <= n ; ++len){
		for(int st = 0 ; st + len < n ; ++st){
			int ed = st + len;
			if(!check(st ,ed)){

				continue;
			}
			for(int k = st + 1 ; k < ed ; ++k){
				dp[st][ed] = (dp[st][ed] + dp[st][k] * dp[k][ed]) % MOD;
			}
		}
	}
	cout << dp[0][n - 1] << endl;
	return 0;
}