#include <bits/stdc++.h>
#include "cycle.h"
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define sz(a) a.size()
typedef long long ll;
typedef pair<int, int> pii;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void escape(int n){
int lo = 0;
int hi = n-1;
while(lo < hi){
int mid = (lo+hi+1)/2;
if(jump(mid)){
lo = mid;
if(lo != hi){
jump(n-mid);
}
}
else{
hi = mid-1;
if(lo != hi){
jump(n-mid);
}
}
}
}
