//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define MAX 1000007
#define pb push_back
#define mp make_pair
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>>
const int mod = 2019201997;
const int INF = 1e18;
// myMap.begin()->first : key
// myMap.begin()->second : value
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;/*ans%=mod;a%=mod;*/b>>=1;}return ans/*%mod*/;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
struct DSU {
vi e,sayi; void init(int N) { e = vi(N,-1); sayi = vi(N);}
int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); }
bool sameSet(int a, int b) { return get(a) == get(b); }
int size(int x) { return -e[get(x)]; }
bool unite(int x, int y) { // union by size
x = get(x), y = get(y); if (x == y) return 0;
if (e[x] > e[y]) swap(x,y);
e[x] += e[y]; e[y] = x; sayi[x]+=sayi[y]; return 1;
}
};
typedef tree<pii, null_type, less<pii>, rb_tree_tag,
tree_order_statistics_node_update>ordered_set;
priority_queue<int,vi,greater<int>> rq;
priority_queue<int> lq;
int lsum,rsum;
void add(int a)
{
int medyan=(lq.size()?lq.top():1000000001);
if(a<=medyan) {lq.push(a);lsum+=a;}
else {rq.push(a);rsum+=a;}
// lq.push(a);
if(lq.size()>rq.size()+1)
{
int sayi=lq.top();
lq.pop();
rq.push(sayi);
rsum+=sayi;
lsum-=sayi;
}
if(lq.size()<rq.size()) //whilea gerek yok gibi
{
lq.push(rq.top());
lsum+=rq.top(); rsum-=rq.top();
rq.pop();
}
}
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first + a.second < b.first + b.second;
}
void solve()
{
int n,k; cin >> k >> n;
vpii v = {{0, 0}};
int ans=0;
for(int i=1;i<=n;i++)
{
int b,d;char a,c; cin>>a>>b>>c>>d;
if(a==c) ans+=abs(b-d);
else
{
// add(b); add(d);
v.pb({b,d});
}
}
sort(v.begin(),v.end(),cmp);
n=v.size()-1;
ans += n;
vi pre(MAX);
for(int i=1;i<=n;i++)
{
add(v[i].f); add(v[i].s);
pre[i]=rsum-lsum;
}
// for(int i=1;i<=n;i++) cout << pre[i] << " ";cout<<endl;
if(k==1)
{
cout << ans+pre[n] << endl;
return;
}
while (lq.size()) lq.pop();
while (rq.size()) rq.pop();
lsum=rsum=0;
int cvp=INF;
for(int i=n;i>0;i--)
{
add(v[i].f); add(v[i].s);
cvp=min(cvp,pre[i-1]+rsum-lsum);
}
cout << cvp+ans << endl;
return;
}
int32_t main() {
// freopen("hayfeast.in", "r", stdin);
// freopen("hayfeast.out", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(0);
int t=1;
// cin >> t;
while (t--) solve();
return 0;
}
