#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define int long long
int n;
unordered_set<string> s;
signed main() {
	int T,tot=0;
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	string s1,s2;
	cin>>n>>s1>>s2;
	for(int i=0;i<n;i++){
		int j=i,k=0;
		string ss="";
		while(j<n){
			ss+=s2[j];
			while(ss[j-i]!=s1[k]) k++;
			if(k>=n) break;
			s.insert(ss);
			k++;
			j++;
		}
	}cout<<s.size();
	return 0;
}