#include <bits/stdc++.h>
using namespace std;
int vis[1000];
void bfs(int src)
{
queue<int> q;
q.push(src);
vis[src] = 1;
while(!q.empty()){
int u = q.front();
cout << u << endl;
q.pop();
for(int i=0;i<(int)g[u].size();i++){
int v = g[u][i];
if(!vis[v]){
vis[v] = 1;
q.push(v);
}
}
}
}
int main() {
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgdmlzWzEwMDBdOwoKdm9pZCBiZnMoaW50IHNyYykKewoJcXVldWU8aW50PiBxOwoJcS5wdXNoKHNyYyk7Cgl2aXNbc3JjXSA9IDE7Cgl3aGlsZSghcS5lbXB0eSgpKXsKCQlpbnQgdSA9IHEuZnJvbnQoKTsKCQljb3V0IDw8IHUgPDwgZW5kbDsKCQlxLnBvcCgpOwoJCWZvcihpbnQgaT0wO2k8KGludClnW3VdLnNpemUoKTtpKyspewoJCQlpbnQgdiA9IGdbdV1baV07CgkJCWlmKCF2aXNbdl0pewoJCQkJdmlzW3ZdID0gMTsKCQkJCXEucHVzaCh2KTsKCQkJfQoJCX0KCX0KfQoKaW50IG1haW4oKSB7CgkKCXJldHVybiAwOwp9