/// In The Name Of God
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int k, n;
ll add, ans = linf;
int p1[N], p2[N];
char t1[N], t2[N];
namespace k1 {
int sz;
int a[N];
ll pref[N], suff[N];
void calc(int p) {
ll cur = 0;
int id = upper_bound(a + 1, a + 1 + sz, p) - a;
cur += (ll)p * (id - 1) - pref[id - 1];
cur += suff[id] - (ll)p * (sz - id + 1);
ans = min(ans, cur);
}
void solve() {
for (int i = 1; i <= n; i++) {
if (t1[i] == t2[i]) add += abs(p1[i] - p2[i]);
else {
a[++sz] = p1[i];
a[++sz] = p2[i];
}
}
sort (a + 1, a + 1 + sz);
for (int i = 1; i <= sz; i++) {
pref[i] = pref[i - 1] + a[i];
}
for (int i = sz; i >= 1; i--) {
suff[i] = suff[i + 1] + a[i];
}
for (int i = 1; i <= n; i++) {
calc(p1[i]);
calc(p2[i]);
if (clock() / (double)CLOCKS_PER_SEC > 1.9) break;
}
cout << ans + add;
ioi
}
}
namespace k2 {
ll calc(ll p, ll P1) {
ll cur = 0;
for (int i = 1; i <= n; i++) {
cur += min(abs(p - p1[i]) + abs(p - p2[i]), abs(P1 - p1[i]) + abs(P1 - p2[i]));
}
//ans = min(ans, cur);
if (clock() / (double)CLOCKS_PER_SEC > 1.85) {
cout << ans + add, ioi
}
return cur;
}
void solve() {
vector <ll> a;
int bfr = 0;
for (int i = 1; i <= n; i++) {
a.pb(p1[i]);
a.pb(p2[i]);
if (t1[i] == t2[i]) {
add += abs(p1[i] - p2[i]);
}
else {
p1[++bfr] = p1[i];
p2[bfr] = p2[i];
}
}
//n = bfr;
sort(all(a));
a.erase(unique(all(a)), a.end());
//random_shuffle(all(a));
for (int i = 0; i < sz(a) - 1; i++) {
int l = i, r = sz(a) - 2, res = i + 1;
while (l <= r) {
int mid = l + r >> 1;
if (calc(a[i], a[mid]) >= calc(a[i], a[mid + 1])) res = mid + 1, l = mid + 1;
else r = mid - 1;
}
ans = min(ans, calc(a[i], a[res]));
if (clock() / (double)CLOCKS_PER_SEC > 1.85) break;
}
cout << ans + add;
ioi
}
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
Kazakhstan
cin >> k >> n;
for (int i = 1; i <= n; i++) {
cin >> t1[i] >> p1[i] >> t2[i] >> p2[i];
if (t1[i] != t2[i]) add++;
}
if (k == 1) k1 :: solve();
if (k == 2) k2 :: solve();
ioi
}
