#include "ramen.h"
#include<bits/stdc++.h>
using namespace std;
#define task "a"
#define se second
#define fi first
#define ll long long
#define ii pair<ll, ll>
const long mxN = 2e5 + 7;
vector<int> mn, mx;
void Ramen(int n)
{
if (n == 1)
{
Answer(0, 0);
return;
}
for (int i = 0; i < n; i += 2)
{
if (i == n - 1)
{
mx.push_back(i);
mn.push_back(i);
break;
}
bool tmp = (Compare(i, i + 1) == 1);
mx.push_back(i + !tmp);
mn.push_back(i + tmp);
}
ii ans;
ans.fi = mx[0];
for (int i = 1; i < mx.size(); i++)
{
if (Compare(ans.fi, mx[i]) == -1)
ans.fi = mx[i];
}
ans.se = mn[0];
for (int i = 1; i < mn.size(); i++)
{
if (Compare(ans.se, mn[i]) == 1)
ans.se = mn[i];
}
Answer(ans.se, ans.fi);
}
