#include <cstdio>
#include <vector>
const int N = 1000000000;
int k, n;
std::vector<std::pair<int, int> > a;
long long test2(int x, int y)
{
long long s = 0;
for (int i = 0; i < (int)a.size(); ++i) s += std::min(std::max(a[i].first - x, 0) + std::max(x - a[i].second, 0), std::max(a[i].first - y, 0) + std::max(y - a[i].second, 0));
return s;
}
long long test1(int x)
{
int l = x, r = N, opt;
while (l <= r) {
int m = l + r >> 1;
if (test2(x, m) <= test2(x, m + 1)) {
opt = m;
r = m - 1;
}
else l = m + 1;
}
return test2(x, opt);
}
long long test0()
{
int l = 0, r = N, opt;
while (l <= r) {
int m = l + r >> 1;
if (test1(m) <= test1(m + 1)) {
opt = m;
r = m - 1;
}
else l = m + 1;
}
return test1(opt);
}
int main()
{
long long ans = 0;
scanf("%d%d", &k, &n);
for (int i = 0; i < n; ++i) {
char type_from, type_to;
int from, to;
scanf(" %c%d %c%d", &type_from, &from, &type_to, &to);
if (from > to) std::swap(from, to);
ans += to - from;
if (type_from != type_to) {
a.push_back(std::make_pair(from, to));
++ans;
}
}
if (k == 1) printf("%lld\n", ans + test1(-N) * 2);
else {
long long r = ((long long)1 << 63);
for (int i = 0; i < (int)a.size(); ++i) {
for (int j = 0; j < (int)a.size(); ++j) {
r = std::min(r, test2(a[i].first, a[j].first));
r = std::min(r, test2(a[i].first, a[j].second));
r = std::min(r, test2(a[i].second, a[j].first));
r = std::min(r, test2(a[i].second, a[j].second));
}
}
printf("%lld\n", ans + r * 2);
}
return 0;
}
