#include<bits/stdc++.h>
using namespace std;
int n,ans,cnt;
map<string,int> p;
map<char,int> y;
string a,b,vis;
int main()
{
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		y[a[i]]=1;
	}
	for(int i=0;i<n;i++)
	{
		cin>>b[i];
		y[b[i]]=1;
	}
	for(int i=0;i<26;i++)
	{
		if(y[char('a'+i)]==1)
		{
			cnt++;
		}
	}
	if(cnt==1)
	{
		cout<<n;
		return 0;
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<n-i+1;j++)
		{
			queue <char> c;
			string t;
			for(int o=j;o<j+i;o++)
			{
				c.push(b[o]);
				t+=b[o];
				//cout<<b[o];
			}
			//cout<<endl;
			if(p[t]==1)
			{
				continue;
			}
			for(int o=0;o<n;o++)
			{
				if(a[o]==c.front()&&!c.empty())
				{
					c.pop();
				}
			}
			if(c.empty())
			{
				ans++;
				p[t]=1;
			}
		}
	}
	cout<<ans;
	return 0;
}
/*
20
bcatttttbccciuuiopui
bbccactttttciuuiopuy

20
egebejbhcfabgegjgiig
edfbhhighajibcgfecef
30
tttttttttttttttttttttttttttttt
tttttttttttttttttttttttttttttt
*/