#include "plants.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
int n;
int jem[200001];
void init(int k, std::vector<int> r)
{
n=sz(r);
jem[0]=r[0];
for (int i=1;i<sz(r);i++) jem[i]=jem[i-1]+r[i];
return;
}
int compare_plants(int x, int y) {
if (jem[y-1]-jem[x-1]==0 || (jem[n-1]-jem[y-1])+jem[x-1]==n-y+x)return 1;
if (jem[y-1]-jem[x-1]==y-x || (jem[n-1]-jem[y-1])+jem[x-1]==0)return -1;
return 0;
}
