#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
//#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include "friend.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
int findSample(int n, int confidence[], int host[], int protocol[]) {
int pro = 0 , res = 0 ;
for ( int i = 0 ; i < n ; i++ ) {
pro = protocol[i];
}
if ( pro == 1 ) {
for (int i = 0 ; i < n ;i++) {
res += confidence[i] ;
}
}
else {
for (int i = 0 ; i < n ;i++) {
res = max(confidence[i],res) ;
}
}
return res ;
}
