#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,sse3,avx")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(2e5)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
int k, n, m;
pair<int, int> point[N];
long long suf[N];
bool cmp(pair<int, int> a, pair<int, int> b) {
return (a.ff + a.ss) < (b.ff + b.ss);
}
vector<int> get(int l, int r) {
if(l > r) return {};
vector<int> res;
for(int i = l; i <= r; i ++) res.pb(point[i].ff), res.pb(point[i].ss);
sort(all(res));
return res;
}
multiset<int> v1, v2;
long long sumv1 = 0, sumv2 = 0, siz = 0;
void add(int x) {
siz ++;
if(siz == 1) {
sumv1 += x;
v1.insert(x);
return;
}
if(x <= *v1.rbegin()) {
sumv1 += x;
v1.insert(x);
} else {
sumv2 += x;
v2.insert(x);
}
if(v1.size() > (siz + 1) / 2) {
int x = *v1.rbegin();
sumv1 -= x;
v1.erase(--v1.end());
sumv2 += x;
v2.insert(x);
} else if(v1.size() < (siz + 1) / 2) {
int x = *v2.begin();
sumv2 -= x;
v2.erase(v2.begin());
sumv1 += x;
v1.insert(x);
}
}
void Baizho() {
cin>>k>>n;
long long ex = 0;
for(int i = 1; i <= n; i ++) {
char p, q;
int s, t;
cin>>p>>s>>q>>t;
if(s > t) swap(s, t);
if(p == q) ex += t - s;
else {
ex ++;
point[++m] = {s, t};
}
}
sort(point + 1, point + m + 1, cmp);
long long ans = 0;
if(k == 1) {
vector<int> pos = get(1, m);
int mid = (pos.size()) / 2;
for(auto x : pos) ans += abs(pos[mid] - x);
} else if(k == 2 && m) {
ans = inf;
for(int i = m; i >= 1; i --) {
add(point[i].ff);
add(point[i].ss);
int median = *v1.rbegin();
suf[i] = 1LL * sumv2 - sumv1 + median * (v1.size() - v2.size());
}
sumv1 = 0, sumv2 = 0, siz = 0;
v1.clear(), v2.clear();
for(int i = 1; i <= m; i ++) {
add(point[i].ff);
add(point[i].ss);
int median = *v1.rbegin();
long long res = suf[i + 1] + 1LL * sumv2 - sumv1 + median * (v1.size() - v2.size());
ans = min(ans, res);
}
}
cout<<ans + ex;
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
