#include <bits/stdc++.h>
using namespace std;
inline long long read(){
    long long x=0; char ch; bool f=0;
    while(((ch=getchar())<'0'||ch>'9')&&ch!='-') ;
    if(ch=='-') f=1;
    else x=ch^48;
    while((ch=getchar())>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48);
    return f?-x:x;
}
const int N=8e5+15;
int n;
char a[N];
int s[N];
#define P 13131
#define ull unsigned long long
ull pw[N],s1[N];
ull get(int l,int r){
	assert(1<=l&&l<=n&&1<=r&&r<=n);
	if(l>r) return 0;
	return s1[r]-s1[l-1]*pw[r-l+1];
}
int LCP(int x,int y,int le){
	if(x>y) swap(x,y);
	if(y>n) return 0;
	int l=1,r=le; 
	r=min(r,y-x);
	if(x<=n/2) r=min(r,n/2-x+1);
	else r=min(r,n-x+1);
	if(y<=n/2) r=min(r,n/2-y+1);
	else r=min(r,n-y+1);
	while(l<=r){
		int mid=(l+r)/2;
		if(get(x,x+mid-1)==get(y,y+mid-1)) l=mid+1;
		else r=mid-1;
	}
	return r;
}
int LCS(int x,int y,int le){
	if(x>y) swap(x,y);
	if(y>n) return 0; 
	int l=1,r=le; r=min(r,y-x);
	if(x<=n/2) r=min(r,x); 
	else r=min(r,x-n/2);
	if(y<=n/2) r=min(r,y);
	else r=min(r,y-n/2);
	while(l<=r){
		int mid=(l+r)/2;
		if(get(x-mid+1,x)==get(y-mid+1,y)) l=mid+1;
		else r=mid-1;
	}
	return r;
}
int main(){
//	freopen("t1.in","r",stdin);
	n=read();
	scanf("%s",a+1);
	for(int i=1;i<=n;i++) s[i]=a[i];
	int ls=n;
	scanf("%s",a+1);
	for(int i=1;i<=ls;i++) s[++n]=a[i];
	pw[0]=1;
	for(int i=1;i<=n*2;i++) pw[i]=pw[i-1]*P;
	for(int i=1;i<=n;i++) s1[i]=s1[i-1]*P+s[i];
	for(int le=ls;le>=1;le--){
		int f=0;
		for(int i=1;!f&&i+le*2-2<=ls;i+=le){
			if(!f){
				int t1=LCS(ls+i+le-2,ls+i+2*le-2,le),t2=LCS(i+le-1-t1,ls+i+2*le-2-t1,le-t1),t3=LCP(ls+i+le-1,ls+i+2*le-1,le);
				if(t1+t2+t3>=le){
					f=1;
				}
			}
			if(!f){
				if(LCS(i+le-1,ls+i+2*le-2,le)+LCP(i+le,ls+i+2*le-1,ls-(i+2*le)+2)>=le){
					f=1;
				}
			}
			if(!f&&i+2*le<=ls){
				int t1=LCP(i+le,i+2*le,le),t2=LCP(i+le+t1,ls+i+2*le-1+t1,le-t1),t3=LCS(i+le-1,i+2*le-1,le);
				if(t1+t2+t3>=le){
					f=1;
				}
			}
		}
		if(f){
			printf("%d\n",le*2); return 0;
		}
	}
	printf("0\n");
	return 0;
}