#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <cmath>
#include <fstream>
#include <string>
#include <iomanip>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <time.h>

using namespace std;

#define ll long long
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)

typedef vector <pair <int ,int > > vpii;
typedef vector <pair <ll ,ll > > vpll;
typedef vector <pair <double ,double > > vpdd;
typedef vector<int> vi;
typedef vector <ll> vl;
typedef vector <char> vc;
typedef vector <double> vd;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <double, double> pdd;

int main() {
 //freopen("input.txt", "r", stdin);
 //freopen("output.txt", "w", stdout);
 ios_base::sync_with_stdio(false);
 cin.tie(0);
 cout.tie(0);
  int n;
 cin >> n;
 vpii a(n);
 srand(time(NULL));
 for(int i = 0; i < n; i++){
   a[i].f = (double)rand();
   a[i].s = i + 1;
 }
 vd b(n);
 for(int i = 0; i < n; i++){
   b[i] = a[i].f;
 }
 for(int i = 0; i < n; i++){
   for(int j = n - 1; j >= i; j--){
     if(a[j].f < a[j - 1].f){
       swap(a[j], a[j - 1]);
     }
   }
 }
 int max = -1;
 int nmax;
 int nmin;
 int min = 1e9;
 for(int i = 0; i < n; i++){
   if(a[i].f > max){
     max = a[i].f;
     nmax = a[i].s;
   }
   if(a[i].f < min){
     min = a[i].f;
     nmin = a[i].s;
   }
 }
 cout << max << ' ' << nmax << ' ' << min << ' ' << nmin;
}