#include using namespace std; int group[1000]; int find(int a){ if(a==group[a]) return a; return group[a]=find(group[a]); } void merge(int a,int b){ a=find(a); b=find(b); group[a]=b; } double sq(long long int ll){ long long int r=1e10,l=0; cout<1){ cout<ll) r=m; else l=m; } return (r+l)/2; } int main(){ int n; cin>>n; long long int x[n],y[n]; for(int i=0;i>x[i]>>y[i]; vector> v; for(int i=0;i(v[i]); int a=get<1>(v[i]),b=get<2>(v[i]); if(find(a)!=find(b)){ l=length; merge(a,b); } if(find(0)==find(n-1)) break; } long long int calc=sq(l)/10; calc*=10; if(calc*calc==l) cout<