#include<bits/stdc++.h>
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define ll long long
#define lll __int128
#define fi first
#define se second
#define e emplace
#define eb emplace_back
#define db double
#define ef emplace_front
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<ll>
#define vp vector<pii>
#define vt vector<tup>
#define all(x) x.begin(),x.end()
#define mp make_pair

#define FastI
#define FastO
#define int ll
bool ST;
static const ll MOD=998244353,Phi=998244352,inv2=499122177,Root=3,iRoot=332748118;
static const ll inf=1073741823,Inf=4294967296,INF=4557430888798830399;
static const ld eps=1e-9,pi=3.1415926535;
char in[200000030],*p1=in,*p2=in;
char out[1<<20],*p3=out;
using namespace std;
struct tup
{
	int x,y,z;
	tup(int X=0,int Y=0,int Z=0)
	{x=X,y=Y,z=Z;}
};
#ifdef FastI
#define getchar() (p1==p2&&(p2=(p1=in)+fread(in,1,200000030,stdin),p1==p2)?EOF:*p1++)
#endif
#ifdef FastO
#define putchar(x) (p3-out==1<<20?fwrite(out,1,1<<20,stdout),p3=out,0:0,*p3++=x)
#define puts(x) write(x,'\n')
#endif
namespace FastIO
{
	template<typename T> inline void write(T x,char ch=' ')
	{
		if(is_same<char,T>::value)putchar(x);
		else
		{
			if(x<0)x=-x,putchar('-');
			static char st[40];
			int top=0;
			do st[top++]=x%10+'0',x/=10;while(x);
			while(top)putchar(st[--top]);
		}
		ch!='~'?putchar(ch):0;
	}
	inline void write(const char*x,char ch=' ')
	{
		for(int i=0;x[i]!='\0';++i)putchar(x[i]);
		ch!='~'?putchar(ch):0;
	}
	inline void read(char&s){do s=getchar();while(s=='\n'||s==' ');}
	inline void read(char s[])
	{
		int len=0;char st;
		do st=getchar();while(st=='\n'||st==' ');
		s[++len]=st,st=getchar();
		while(st!='\n'&&st!=' '&&st!='\r'&&st!='\0')s[++len]=st,st=getchar();
		s[++len]='\0';
	}
	template<typename T> inline void read(T &s)
	{
		char ch=getchar();s=0;
		while((ch>'9'||ch<'0')&&ch!='-')ch=getchar();
		bool tf=(ch=='-'&&(ch=getchar()));
		while(ch>='0'&&ch<='9')s=(s<<1)+(s<<3)+ch-'0',ch=getchar();
		s=tf?-s:s;
	}
	inline void edl(){putchar('\n');}
	template<typename T1,typename T2> inline void read(pair<T1,T2> &s){read(s.fi),read(s.se);}
	template<typename T,typename...Args> inline void write(T x,Args...args){write(x,'~'),write(args...);}
	template<typename T,typename...Args> inline void read(T&x,Args&...args){read(x),read(args...);}
	#ifdef FastO
	struct Writer{~Writer(){fwrite(out,1,p3-out,stdout);}}Writ;
	#endif
}
using namespace FastIO;
namespace MTool
{
	inline int Cadd(int a,int b){return (ll)a+b>=MOD?(ll)a+b-MOD:a+b;}
	inline int Cdel(int a,int b){return a-b<0?a-b+MOD:a-b;}
	inline int Cmul(int a,int b){return 1ll*a*b%MOD;}
	inline int sqr(int a){return 1ll*a*a%MOD;}
	inline void Madd(int&a,int b){a=((ll)a+b>=MOD?(ll)a+b-MOD:a+b);}
	inline void Mdel(int&a,int b){a=(a-b<0?a-b+MOD:a-b);}
	inline void Mmul(int&a,int b){a=1ll*a*b%MOD;}
	inline int Cmod(int x){return (x%MOD+MOD)%MOD;}
	inline void Mmod(int&x){x=(x%MOD+MOD)%MOD;}
	template<typename T> inline bool Mmax(T&a,T b){return a<b?a=b,1:0;}
	template<typename T> inline bool Mmin(T&a,T b){return a>b?a=b,1:0;}
	template<typename...Args> inline void Madd(int&a,int b,Args...args){Madd(a,b),Madd(a,args...);}
	template<typename...Args> inline void Mmul(int&a,int b,Args...args){Mmul(a,b),Mmul(a,args...);}
	template<typename...Args> inline void Mdel(int&a,int b,Args...args){Mdel(a,b),Mdel(a,args...);}
	template<typename...Args> inline int Cadd(int a,int b,Args...args){return Cadd(Cadd(a,b),args...);}
	template<typename...Args> inline int Cmul(int a,int b,Args...args){return Cmul(Cmul(a,b),args...);}
	template<typename...Args> inline int Cdel(int a,int b,Args...args){return Cdel(Cdel(a,b),args...);}
	template<typename...Args,typename T> inline bool Mmax(T&a,T b,Args...args){return Mmax(a,b)|Mmax(a,args...);}
	template<typename...Args,typename T> inline bool Mmin(T&a,T b,Args...args){return Mmin(a,b)|Mmin(a,args...);}
	inline int power(int x,int y){int s=1;for(;y;y>>=1,Mmul(x,x))if(y&1)Mmul(s,x);return s;}
}
using namespace MTool;
namespace WrongAnswer_90
{
	int n,m=128,F[21][800010],sa[800010],rk[800010],b[800010],x[1600010],y[1600010];
	int L[200010][2],R[200010][2];
	char t[2][200010],s[800010];
	inline int ask(int x,int y)
	{
		if(!x||!y)return 0;
	    if(x==y)return inf;
	    if((x=rk[x])>(y=rk[y]))swap(x,y);
	    int k=__lg(y-x++);
	    return min(F[k][x],F[k][y-(1<<k)+1]);
	}
	inline void SA(int n)
	{
	    for(int i=1;i<=n;++i)++b[x[i]=s[i]];
	    for(int i=2;i<=m;++i)b[i]+=b[i-1];
	    for(int i=1;i<=n;++i)sa[b[x[i]]--]=i;
	    for(int k=1,num=0;k<=n;k<<=1,num=0)
	    {
	        for(int i=n-k+1;i<=n;++i)y[++num]=i;
	        for(int i=1;i<=n;++i)if(sa[i]>k)y[++num]=sa[i]-k;
	        for(int i=1;i<=m;++i)b[i]=0;
	        for(int i=1;i<=n;++i)++b[x[i]];
	        for(int i=2;i<=m;++i)b[i]+=b[i-1];
	        for(int i=n;i>=1;--i)sa[b[x[y[i]]]--]=y[i];
	        swap(x,y),x[sa[1]]=1;
	        for(int i=2;i<=n;++i)
	        {
	            if(y[sa[i]]==y[sa[i-1]]&&y[sa[i]+k]==y[sa[i-1]+k])x[sa[i]]=x[sa[i-1]];
	            else x[sa[i]]=x[sa[i-1]]+1;
	        }
	        if((m=x[sa[n]])==n)break;
	    }
	    for(int i=1;i<=n;++i)rk[sa[i]]=i;
	    for(int i=1,k=0;i<=n;++i,k?--k:0)
	    {
	        while(s[i+k]==s[sa[rk[i]-1]+k])++k;
	        F[0][rk[i]]=k;
	    }
	    for(int i=1;i<=20;++i)
	    {
	        for(int j=1;j+(1<<i)-1<=n;++j)
	        F[i][j]=min(F[i-1][j],F[i-1][j+(1<<(i-1))]);
	    }
	}
	
	void mian()
	{
		read(n),++n;
		read(t[0]),t[0][n]='?';
		read(t[1]+1),t[1][1]='!';
		int len=0;
		for(int i=1;i<=n;++i)s[++len]=t[0][i],R[i][0]=len;s[++len]='#';
		for(int i=1;i<=n;++i)s[++len]=t[1][i],R[i][1]=len;s[++len]='$';
		for(int i=1;i<=n;++i)s[++len]=t[0][n-i+1],L[n-i+1][0]=len;s[++len]='*';
		for(int i=1;i<=n;++i)s[++len]=t[1][n-i+1],L[n-i+1][1]=len;
//		for(int i=1;i<=n;++i)cerr<<t[0][i];cerr<<endl;
//		for(int i=1;i<=n;++i)cerr<<t[1][i];cerr<<endl;
		SA(len);
//		cerr<<ask(L[3][1],L[6][1])<<endl;
//		cerr<<ask(R[4][1],R[7][1])<<endl;
//		exit(0);
		for(int i=n/2;i>=1;--i)
		{
			for(int x=i,y=2*i;y<=n;x+=i,y+=i)
			{
				int r=ask(R[x+1][1],R[y+1][1]);
				int l=ask(L[x][1],L[y][1]);
				l+=ask(L[x-l][0],L[y-l][1]);
//				cerr<<"???";
				if(l+r>=i)return write(i<<1);
				l=ask(L[x][0],L[y][0]);
				r=ask(R[x+1][0],R[y+1][0]);
				r+=ask(R[x+1+r][0],R[y+1+r][1]);
				if(l+r>=i)return write(i<<1);
				r=ask(R[x+1][0],R[y+1][1]);
				r+=ask(R[x+1+r][1],R[y+1+r][1]);
				l=ask(L[x][0],L[y][1]);
				if(l+r>=i)return write(i<<1);
				r=ask(R[x+1][0],R[y+1][1]);
				l=ask(L[x][0],L[y][1]);
				l+=ask(L[x-l][0],L[y-l][0]);
				if(l+r>=i)return write(i<<1);
			}
		}
		puts("0");
	}
	inline void Mian()
	{
		int T=1;
//		read(T);
		while(T--)mian();
	}
}
bool ED;
signed main()
{
//	ios::sync_with_stdio(0);
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	double st=clock();
	WrongAnswer_90::Mian();
	double ed=clock();
 	cerr<<endl;
 	cerr<<"Time: "<<ed-st<<" ms\n";
 	cerr<<"Memory: "<<abs(&ST-&ED)/1024.0/1024.0<<" MB\n";
	return 0;
}