#include<stdio.h>
#include<stdlib.h>
#include<string.h>
char a[60], b[60];
typedef struct BiTNode
{
char data;
struct BiTNode *lchild, *rchild;
}BiTNode, *BiTree;
BiTNode *createtree(char a[], char b[], int l)
{
char *p;
BiTNode *T;
if(l == 0)
return NULL;
T = new BiTNode;
T->data = a[0];
for(p = b; p != '\0'; p++)
{
if(*p == a[0])
break;
}
int t = p - b;
T->lchild = createtree(a+1,b,t);
T->rchild = createtree(a+t+1,p+1,l-t-1);
return T;
}
int deep(BiTree T)
{
int d = 0;
if(T)
{
int l1 = deep(T->lchild);
int l2 = deep(T->rchild);
d = (l1>l2?l1:l2) + 1;
}
return d;
}
int main()
{
int n;
while(~scanf("%d",&n))
{
scanf("%s",a);
scanf("%s",b);
BiTNode *T;
T = createtree(a,b,n);
int m = deep(T);
printf("%d\n",m);
}
return 0;
}