#include "ramen.h"
/*
* Author: Nonoze
* Created: Friday 19/12/2025
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;
pair<int, int> calc(int l, int r) {
if (l==r) return {l, r};
if (l+1==r) return (Compare(l, r) == -1 ? mp(l, r) : mp(r, l));
if (r-l+1==3) {
int cnt1=0, cnt2=0, cnt3=0;
int a = Compare(l, l+1); cnt1+=(a==1); cnt2+=(a==-1);
int b = Compare(l+1, r); cnt2+=(b==1); cnt3+=(b==-1);
int c = Compare(l, r); cnt1+=(c==1); cnt3+=(c==-1);
pair<int, int> res;
if (cnt1==0) res.first = l;
else if (cnt2==0) res.first = l+1;
else res.first = r;
if (cnt1==2) res.second = l;
else if (cnt2==2) res.second = l+1;
else res.second = r;
return res;
}
int mid = (l + r) / 2;
pair<int, int> left = calc(l, mid);
pair<int, int> right = calc(mid+1, r);
pair<int, int> res;
res.first = (Compare(left.first, right.first) == -1 ? left.first : right.first);
res.second = (Compare(left.second, right.second) == 1 ? left.second : right.second);
// cout << l << ' ' << r << " -> " << res.first << ' ' << res.second << endl;
return res;
}
void Ramen(int N) {
pair<int, int> ans = calc(0, N-1);
// cout << ans.first << ' ' << ans.second << endl;
Answer(ans.first, ans.second);
}
