#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod=998244353;
ll n,m,k,i,j,l,r,x,y,z,w,s,t,a[1100000],b[1100000],pw[1100000],root,dp[1100000],prvlen,ee,chk[1100000],len;
vector<ll> v[1100000],u[1100000],tmp,vec,prvvec,cycle;
ll same_vector(vector<ll> a,vector<ll> b)
{
    ll i,m,s=0,t=0;
    m=a.size();
    for(i=0;i<m;i++)
    {
        s=(s*root+a[i])%mod;
        t=(t*root+b[i])%mod;
    }
    if(s==t)
        return 1;
    for(i=0;i<m;i++)
    {
        t=(t*root%mod-b[i]*pw[m]%mod+b[i]+mod)%mod;
        if(s==t)
            return 1;
    }
    return 0;
}
ll dfs(ll x,ll y)
{
    ll i,z;
    chk[x]=1;
    for(i=0;i<v[x].size();i++)
    {
        if(v[x][i]==y)
            continue;
        if(chk[v[x][i]])
        {
            cycle.push_back(x);
            return x;
        }
        z=dfs(v[x][i],x);
        if(z)
        {
            cycle.push_back(x);
            return z;
        }
    }
    return 0;
}
ll f(ll x,ll y)
{
    ll i,s=1;
    dp[x]=0;
    for(i=0;i<v[x].size();i++)
    {
        if(v[x][i]==y||chk[v[x][i]])
            continue;
        f(v[x][i],x);
    }
    tmp.clear();
    for(i=0;i<v[x].size();i++)
    {
        if(v[x][i]==y||chk[v[x][i]])
            continue;
        tmp.push_back(dp[v[x][i]]);
    }
    sort(tmp.begin(),tmp.end());
    for(i=0;i<tmp.size();i++)
    {
        s=(s*root+tmp[i])%mod;
    }
    dp[x]=s;
    return dp[x];
}
void solve()
{
    //printf("!");
    ll i;
    vec.clear();
    len=0;
    for(i=1;i<=n;i++)
        chk[i]=0;
    x=dfs(1,0);
    cycle.clear();
    for(i=1;i<=n;i++)
        chk[i]=0;
    dfs(x,0);
    //printf("?");
    len=cycle.size();
    for(i=1;i<=n;i++)
    {
        chk[i]=0;
    }
    for(i=0;i<cycle.size();i++)
    {
        chk[cycle[i]]=1;
    }
    for(i=0;i<cycle.size();i++)
    {
        vec.push_back(f(cycle[i],0));
    }
}
int main()
{
    srand(time(NULL));
    scanf("%lld",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%lld %lld",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(i=1;i<=n;i++)
    {
        scanf("%lld %lld",&x,&y);
        u[x].push_back(y);
        u[y].push_back(x);
    }
    for(ee=0;ee<30;ee++)
    {
        root=rand()+20000;
        pw[0]=1;
        for(i=1;i<=200000;i++)
        {
            pw[i]=pw[i-1]*root%mod;
        }
        solve();
        for(i=1;i<=n;i++)
        {
            swap(v[i],u[i]);
        }
        prvlen=len;
        prvvec.clear();
        swap(prvvec,vec);
        solve();
        for(i=1;i<=n;i++)
        {
            swap(v[i],u[i]);
        }
        if(len!=prvlen)
        {
            printf("No");
            return 0;
        }
        if(prvvec.size()!=vec.size())
        {
            printf("No");
            return 0;
        }
        s=0;
        if(same_vector(prvvec,vec))
            s=1;
        if(s)
            continue;
        reverse(vec.begin(),vec.end());
        if(same_vector(prvvec,vec))
            s=1;
        if(s)
            continue;
        printf("No");
        return 0;
    }
    printf("Yes");
}