#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i,n) for(ll i = 0; i < ll(n); i++)
#define rep2(i,l,r) for(ll i=ll(l); i<ll(r); i++)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin,A.end()
#define elif else if
using pii = pair<ll, ll>;

template<class T>
bool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}
template<class T>
bool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}

template<class T>
void print(vector<T> a) {
  for (auto x : a) cerr << x << ' ';
  cout << endl;
}

template<class T>
void print(T x) {
  cerr << x << '\n';
}

template<class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  cerr << head << ' ';
  print(forward<Tail>(tail)...);
}

constexpr ll mod = 1e9 + 7;

int B = 1234567;
int invB = 989145189;

int B2 = 123456;
int invB2 = 78351802;

int inf=1<<30;
vll powB(3010,1),powinvB(3010,1);
vll powB2(3010,1),powinvB2(3010,1);

int calc(int n,vi a,vi b){
  unordered_map<ll,vi>S;
  rep(off,n){
    ll h=0;
    ll h2=0;
    rep(i,n){
      h+=powB[i]*b[(i-off+n)%n];
      h%=mod;
      h2+=powB2[i]*b[(i-off+n)%n];
      h2%=mod;
    }
    S[(h<<30)|h2].push_back(off);
    // print(off,h);
  }

  int ans=inf;

  auto upd_ans=[&](ll h1,ll h2,int tmp)->void{
    ll h=(h1<<30)|h2;
    if(S.find(h)!=S.end()){
      auto it=lower_bound(S[h].begin(),S[h].end(),0);
      int res=(n-1)*(*it)+tmp;
      ans=min(ans,res);
      // print("!!!!",tmp,res);
    }
  };
  rep(i,n){
    vll res(n,0);
    vll res2(n,0);
    rep(j,n)res[j]=powB[j]*a[j]%mod;
    rep(j,n)res2[j]=powB2[j]*a[j]%mod;
    ll h=0;
    ll h2=0;
    rep(j,n){
      h+=res[j];
      h%=mod;
      h2+=res2[j];
      h2%=mod;
    }
    upd_ans(h,h2,0);
    int l=i;
    rep2(t,1,n){
      int r=(l+1)%n;
      h+=mod-res[l];
      h+=mod-res[r];
      h2+=mod-res2[l];
      h2+=mod-res2[r];
      res[l]=a[r]*powB[l]%mod;
      res[r]=a[i]*powB[r]%mod;
      res2[l]=a[r]*powB2[l]%mod;
      res2[r]=a[i]*powB2[r]%mod;
      h+=res[l];
      h+=res[r];
      h2+=res2[l];
      h2+=res2[r];
      h%=mod;
      h2%=mod;
      upd_ans(h,h2,t);
      // print(res);
      l+=1;
      l%=n;
    }
  }
  return ans;
}

void solve() {
  int n;
  cin>>n;
  vi a(n),b(n);
  rep(i,n)cin>>a[i];
  rep(i,n)cin>>b[i];

  int ans1=calc(n,a,b);
  reverse(a.begin(),a.end());
  reverse(b.begin(),b.end());
  int ans2=calc(n,a,b);

  int ans=min(ans1,ans2);
  if(ans1==inf)ans=-1;
  cout<<ans<<endl;

}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);

  rep2(i,1,3010){
    powB[i]=powB[i-1]*B%mod;
    powinvB[i]=powinvB[i-1]*invB%mod;
    powB2[i]=powB2[i-1]*B%mod;
    powinvB2[i]=powinvB2[i-1]*invB2%mod;
  }

  solve();

  return 0;
}