#include "dungeon2.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=207, INF=1e9+7;
vector<int>V[LIM], typ[LIM], P;
int odl[LIM][LIM], jaki[LIM], pot[6], n=1;
int licz(int x, int k) {
  rep(i, k) x/=3;
  return x%3;
}
void DFS(int x, int o) {
  int a=NumberOfRoads();
  rep(i, a) {
    V[x].pb(0);
    typ[x].pb(0);
  }
  if(x!=o) {
    int p=LastRoad(); --p;
    V[x][p]=o;
    typ[x][p]=1;
  }
  rep(i, V[x].size()) if(typ[x][i]==0) {
    Move(i+1, 2);
    if(Color()!=1) {
      V[x][i]+=Color()-2;
      Move(LastRoad(), Color());
      continue;
    }
    V[x][i]=n++;
    typ[x][i]=2;
    DFS(n-1, x);
  }
  bool ok=false;
  rep(i, V[x].size()) if(typ[x][i]==0) {
    ok=true;
    jaki[x]=P.size();
    P.pb(x);
    break;
  }
  rep(i, V[x].size()) if(typ[x][i]==1) Move(i+1, 2);
}
void DFS2(int x, int k) {
  rep(i, V[x].size()) if(typ[x][i]==2) {
    Move(i+1, licz(jaki[x], k)+1);
    DFS2(V[x][i], k);
  }
  rep(i, V[x].size()) if(typ[x][i]==0) {
    Move(i+1, licz(jaki[x], k)+1);
    V[x][i]+=pot[k]*(Color()-1);
    Move(LastRoad(), Color());
  }
  rep(i, V[x].size()) if(typ[x][i]==1) Move(i+1, licz(x, k)+1);
}
void Inspect(int R) {
  pot[0]=1;
  rep(i, 5) pot[i+1]=3*pot[i];
  DFS(0, 0);
  for(int k=0; pot[k]<P.size(); ++k) DFS2(0, k);
  rep(i, n) rep(j, V[i].size()) if(typ[i][j]==0) V[i][j]=P[V[i][j]];
  rep(i, n) {
    rep(j, n) odl[i][j]=INF;
    odl[i][i]=0;
    queue<int>q;
    q.push(i);
    while(!q.empty()) {
      int p=q.front(); q.pop();
      for(auto j : V[p]) if(odl[i][j]>odl[i][p]+1) {
        odl[i][j]=odl[i][p]+1;
        q.push(j);
      }
    }
  }
  for(int d=1; d<=R; ++d) {
    int ans=0;
    rep(i, n) rep(j, i) if(odl[i][j]==d) ++ans;
    Answer(d, ans);
  }
}