#include<bits/stdc++.h>
using namespace std;
struct node{
char p,q;
long long s,t;
void inn(){
cin>>p>>s>>q>>t;
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int k,n;cin>>k>>n;
vector<node>arr(n);
vector<long long>brr;
for (int i = 0;i<n;++i){
arr[i].inn();
if (arr[i].p!=arr[i].q){
brr.push_back(arr[i].s);
brr.push_back(arr[i].t);
}
}
const long long mxn = 1e18;
long long ans = mxn;
sort(brr.begin(),brr.end());
if (k == 1 || brr.size() <= 1){
for (int i = 0;i<2;++i){
long long curans = 0;
int temp = (int)brr.size()/2 - 1 + i;
for (int j = 0;j<n;++j){
if (arr[j].p == arr[j].q){
curans+=abs(arr[j].t - arr[j].s);
}
else{
curans+=abs(arr[j].t - brr[temp]) + abs(arr[j].s - brr[temp]) + 1;
}
}
ans = min(ans,curans);
}
}
if (k == 2 && (int)brr.size() > 1){
vector<int>pos;
pos.push_back(2);
pos.push_back(3);
pos.push_back(5);
pos.push_back(7);
pos.push_back(11);
pos.push_back(13);
pos.push_back(17);
for (int p = 0;p<7;++p){
for (int d = 1;d<(int)brr.size();d*=pos[p]){
for (int y = 0;y<(int)brr.size();++y){
int x = (y + d)%(int)brr.size();
long long curans = 0;
for (int j = 0;j<n;++j){
if (arr[j].p == arr[j].q){
curans+=abs(arr[j].t - arr[j].s);
}
else{
curans+=min(llabs(arr[j].t - brr[x]) + llabs(arr[j].s - brr[x]),llabs(arr[j].t - brr[y]) + llabs(arr[j].s - brr[y])) + 1LL;
}
}
ans = min(curans,ans);
}
}
}
}
cout<<ans<<'\n';
return 0;
}
