# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1177710 | alwaus424 | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(m) for(int i = 0; i < m; i++)
#define fro(m) for(int i=1; i<m; i++)
#define _ "\n"
#define nll cout<<'\n'
#define ff first
#define ss second
#define inff (1<<30)
#define srt(m) sort(m.begin(),m.end())
#define srtr(m) sort(m.rbegin(),m.rend())
#define rev(m) reverse(m.begin(),m.end())
void solve() {
int n; cin >> n;
vector<ll>v(n);
fr(n*2) cin >> v[i];
if(v[1] < 0 ) cout << 1;
else cout << 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// int t;
// cin >> t;
// while (t--)
solve();
return 0;
}