//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl '\n'
#include "rail.h"
int it[101];
void findLocation(int n, int x, int aa[], int bb[])
{
pair<int,int> mi;
for(int i=1;i<n;i++){
it[i]=getDistance(0,i);
if(i==1){
mi={it[i],i};
}
else{
mi=min(mi,{it[i],i});
}
}
aa[0]=x;
bb[0]=1;
for(int i=1;i<n;i++){
bb[i]=2;
}
//cout<<mi.a<<","<<mi.b<<endl;
for(int i=1;i<n;i++){
/*if(mi.b!=i){
int xx=getDistance(mi.b,i);
if(it[i]==mi.a+xx){
cout<<xx<<":"<<it[i]<<":"<<i<<endl;
aa[i]=it[i]+mi.a-xx;
continue;
}
}*/
aa[i]=it[i]+x;
}
/*for(int i=0;i<n;i++){
cout<<aa[i]<<":";
}
cout<<endl;
*/
}
