#include<bits/stdc++.h>
using namespace std;
bool check(int a[], int b[], int i, int j, int n)
{
int count = 0;
int y = i;
int c = 1;
while(y <= j && c <= n)
{
if(a[y] == b[c])
{
count = count + 1;
y = y + 1;
c = c + 1;
}
else
{
c = c + 1;
}
}
if(count == j - i + 1)
return true;
return false;
}
int main()
{
int n;
cin >> n;
int a[n+1] = {0};
int b[n+1] = {0};
for(int i=1; i<=n; i++)
{
cin >> a[i];
}
for(int i=1; i<=n; i++)
{
cin >> b[i];
}
int r = 0;
for(int i=1; i<=n; i++)
{
for(int j=i; j<=n; j++)
{
// a[i...j]
if(check(a,b,i,j,n) == true)
{
int length = j - i + 1;
r = max(r, length);
}
}
}
cout <<"Number of Operations needed to make Array 'B' equal Array 'A: "<<n-r;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmJvb2wgY2hlY2soaW50IGFbXSwgaW50IGJbXSwgaW50IGksIGludCBqLCBpbnQgbikKewogICAgaW50IGNvdW50ID0gMDsgCiAgICBpbnQgeSA9IGk7IAogICAgaW50IGMgPSAxOwoKICAgIHdoaWxlKHkgPD0gaiAmJiBjIDw9IG4pCiAgICB7CiAgICAgICAgaWYoYVt5XSA9PSBiW2NdKQogICAgICAgIHsKICAgICAgICAgICAgY291bnQgPSBjb3VudCArIDE7CiAgICAgICAgICAgIHkgPSB5ICsgMTsKICAgICAgICAgICAgYyA9IGMgKyAxOwogICAgICAgIH0KICAgICAgICBlbHNlCiAgICAgICAgewogICAgICAgICAgICBjID0gYyArIDE7IAogICAgICAgIH0KICAgIH0KCiAgICBpZihjb3VudCA9PSBqIC0gaSArIDEpCiAgICAgICAgcmV0dXJuIHRydWU7CgogICAgcmV0dXJuIGZhbHNlOwp9CgppbnQgbWFpbigpCnsKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgaW50IGFbbisxXSA9IHswfTsKICAgIGludCBiW24rMV0gPSB7MH07CiAgCiAgICBmb3IoaW50IGk9MTsgaTw9bjsgaSsrKQogICAgewogICAgICAgIGNpbiA+PiBhW2ldOwogICAgfQogIAogICAgZm9yKGludCBpPTE7IGk8PW47IGkrKykKICAgIHsKICAgICAgICBjaW4gPj4gYltpXTsKICAgIH0KICAKICAgIGludCByID0gMDsKCiAgICBmb3IoaW50IGk9MTsgaTw9bjsgaSsrKQogICAgewogICAgICAgIGZvcihpbnQgaj1pOyBqPD1uOyBqKyspCiAgICAgICAgewogICAgICAgICAgICAvLyBhW2kuLi5qXQogICAgICAKICAgICAgICAgICAgaWYoY2hlY2soYSxiLGksaixuKSA9PSB0cnVlKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBpbnQgbGVuZ3RoID0gaiAtIGkgKyAxOwogICAgICAgICAgICAgICAgciA9IG1heChyLCBsZW5ndGgpOwogICAgICAgICAgICB9CiAgICAgICAgfQogICAgfQoKICAgIGNvdXQgPDwiTnVtYmVyIG9mIE9wZXJhdGlvbnMgbmVlZGVkIHRvIG1ha2UgQXJyYXkgJ0InIGVxdWFsIEFycmF5ICdBOiAiPDxuLXI7Cn0=