#include <stdio.h>
#include <math.h>
#include <string.h>
#include <limits.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
#include <string>
#include <unordered_map>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include "rail.h"
using namespace std;
#define fi first
#define se second
typedef pair<int,int> ii;
void findLocation(int N, int first, int location[], int stype[])
{
location[0] = first;
stype[0] = 1;
for(int i = 1; i < N; i++)
{
location[i] = first + getDistance(0, i);
stype[i] = 2;
}
}
