#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define REP(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
#define mp make_pair
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(all(v)), v.end())
#define Bit(x, i) ((x >> (i)) & 1)
#define Mask(i) (1 << (i))
#define Cnt(x) __builtin_popcount(x)
#define Cntll(x) __builtin_popcountll(x)
#define Ctz(x) __builtin_ctz(x) // so luong so 0 tinh tu ben phai
#define Ctzll(x) __builtin_ctzll(x)
#define Clz(x) __builtin_clz(x) // so luong so 0 tinh tu ben trai
#define Clzll(x) __builtin_clzll(x)
inline bool maximize(int &u, int v){
return v > u ? u = v, true : false;
}
inline bool minimize(int &u, int v){
return v < u ? u = v, true : false;
}
inline bool maximizell(long long &u, long long v){
return v > u ? u = v, true : false;
}
inline bool minimizell(long long &u, long long v){
return v < u ? u = v, true : false;
}
const int mod = 1e9 + 7;
inline int fastPow(int a, int n){
if(n == 0) return 1;
int t = fastPow(a, n >> 1);
t = 1ll * t * t % mod;
if(n & 1) t = 1ll * t * a % mod;
return t;
}
inline void add(int &u, int v){
u += v;
if(u >= mod) u -= mod;
}
inline void sub(int &u, int v){
u -= v;
if(u < 0) u += mod;
}
const int maxN = 5e3;
const int inf = 1e9;
const long long infll = 1e18;
//int orgs[maxN], orgd[maxN];
//int N;
//int tryCombination(int S[]){
// int Min = inf;
// FOR(i, 0, N - 1){
// if(S[i] != orgs[i]) minimize(Min, orgd[i]);
// }
// if(Min != inf) return Min;
// return -1;
//}
int s[maxN], d[maxN];
//void answer(int s[], int d[]){
// FOR(i, 0, N - 1)cout << s[i] << ' ';cout << '\n';
// FOR(i, 0, N - 1)cout << d[i] << ' ';cout << '\n';
//}
void exploreCave(int n){
int cnt = 1;
memset(d, -1, sizeof(d));
while(cnt <= n){
FOR(i, 0, n - 1){
if(d[i] == -1){
s[i] = 0;
int v = tryCombination(s);
s[i] = 1;
int x = tryCombination(s);;
if(v != x){
if(v == -1){
d[i] = x;
s[i] = 0;
}else if(x == -1){
d[i] = v;
s[i] = 1;
}else{
if(x < v)d[i] = x, s[i] = 1;
else d[i] = v, s[i] = 0;
}
}
}
}
++cnt;
}
answer(s, d);
}
//void process(){
// cin >> N;
// FOR(i, 0, N - 1){
// cin >> orgs[i];
// }
// FOR(i, 0, N - 1){
// cin >> orgd[i];
// }
// exploreCave(N);
//}
//#define LOVE ""
//int main(){
// if(fopen(LOVE".inp", "r")){
// freopen(LOVE".inp", "r", stdin);
// freopen(LOVE".out", "w", stdout);
// }
// ios_base::sync_with_stdio(false);
// cin.tie(0);
// cout.tie(0);
//
// int t = 1;
//// cin >> t;
// while(t--)
// process();
//// cerr << '\n' << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << " s\n" ;
// return 0;
//}
