#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<double, double> pd;
typedef pair<int, int> pi; typedef pair<ll, int> pli;
typedef pair<ll, ll> pll; typedef pair<ll, pi> plp;
typedef tuple<int, int, int> ti; typedef tuple<ll, int, int> tli;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF * 2;
const int MAX_N = 1e5 + 100;
int N, Nr[MAX_N], Cnt[3];
int findSample(int n_, int nr_[], int ho_[], int pr_[]) {
N = n_; for(int i=0; i<N; i++) Nr[i] = nr_[i];
for(int i=1; i<N; i++) Cnt[pr_[i]]++;
if(Cnt[2] == N-1) {
int maxV = -1;
for(int i=0; i<N; i++) maxV = max(maxV, Nr[i]);
return maxV;
}else if(Cnt[1] == N-1) {
int sum = 0;
for(int i=0; i<N; i++) sum += Nr[i];
return sum;
}
return -1;
}
