#include "rail.h"
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'
inline int myrand(int l, int r) {
int ret = rand(); ret <<= 15; ret ^= rand();
if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
return os<<"(" <<p.first<<", "<<p.second<<")"; }
typedef pair<int, int> ii;
template<typename T> using min_pq =
priority_queue<T, vector<T>, greater<T> >;
//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};
void findLocation(int N, int first, int location[], int stype[]) {
stype[0] = 1;
location[0] = first;
if(N == 1) return;
int id = 0, mn = 1e9;
for(int i = 1; i < N; i++) {
int temp = getDistance(0, i);
if(temp < mn) {
mn = temp;
id = i;
}
} //debug(id);
stype[id] = 2;
location[id] = first + getDistance(0, id);
for(int i = 0; i < N; i++) {
if(i == 0 or i == id) continue;
//cout << getDistance(0, i) << ' ' << getDistance(0, id) << ' ' << getDistance(id, i) << endl;
if(getDistance(0, i) - getDistance(0, id) == getDistance(id, i)) {
stype[i] = 1;
location[i] = first - (getDistance(0, i) - 2 * getDistance(0, id));
} else {
stype[i] = 2;
location[i] = first + getDistance(0, i);
}
}
//for(int i = 0; i < N; i++) cout << stype[i] << ' ' << location[i] << endl;
}
