#include <bits/stdc++.h>

using namespace std;
#define int long long

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int k, n;
    cin >> k >> n;
    char p[n], q[n];
    int s[n], t[n];
    for (int i = 0; i < n; i++) cin >> p[i] >> s[i] >> q[i] >> t[i];
    int res = (int) 1e18;
    set<int> all;
    vector<int> ALL;
    for (int i = 0; i < n; i++) {
        if (s[i] < t[i]) swap(s[i], t[i]);
        all.insert(t[i]), all.insert(s[i]);
        if (p[i] != q[i])
            ALL.emplace_back(s[i]), ALL.emplace_back(t[i]);
    }
    if (k == 1) {
        sort(ALL.begin(), ALL.end());
        int x = 0;
        for (int i = 0; i < n; i++) x += s[i] + t[i];
        x /= 2 * n;
        int cur_res = 0;
        for (int i = 0; i < n; i++) {
            if (p[i] == q[i]) {
                cur_res += s[i] - t[i];
                continue;
            }
            int a1 = 0;
            if (x < t[i]) a1 += t[i] - x + s[i] - x + 1;
            else if (x > s[i]) a1 += x - s[i] + x - t[i] + 1;
            else a1 += s[i] - t[i] + 1;
            cur_res += a1;
        }
        res = min(res, cur_res);
        x = ALL[(int) ALL.size() / 2];
        cur_res = 0;
        for (int i = 0; i < n; i++) {
            if (p[i] == q[i]) {
                cur_res += s[i] - t[i];
                continue;
            }
            int a1 = 0;
            if (x < t[i]) a1 += t[i] - x + s[i] - x + 1;
            else if (x > s[i]) a1 += x - s[i] + x - t[i] + 1;
            else a1 += s[i] - t[i] + 1;
            cur_res += a1;
        }
        res = min(res, cur_res);
        x = ALL[((int) ALL.size() + 1) / 2];
        cur_res = 0;
        for (int i = 0; i < n; i++) {
            if (p[i] == q[i]) {
                cur_res += s[i] - t[i];
                continue;
            }
            int a1 = 0;
            if (x < t[i]) a1 += t[i] - x + s[i] - x + 1;
            else if (x > s[i]) a1 += x - s[i] + x - t[i] + 1;
            else a1 += s[i] - t[i] + 1;
            cur_res += a1;
        }
        res = min(res, cur_res);
        cout << res;
        return 0;
    }
    for (int x: all) {
        for (int y: all) {
            int cur_res = 0;
            for (int i = 0; i < n; i++) {
                if (p[i] == q[i]) {
                    cur_res += s[i] - t[i];
                    continue;
                }
                int a1 = 0, a2 = 0;
                if (x < t[i]) a1 += t[i] - x + s[i] - x + 1;
                else if (x > s[i]) a1 += x - s[i] + x - t[i] + 1;
                else a1 += s[i] - t[i] + 1;
                if (y < t[i]) a2 += t[i] - y + s[i] - y + 1;
                else if (y > s[i]) a2 += y - s[i] + y - t[i] + 1;
                else a2 += s[i] - t[i] + 1;
                cur_res += min(a1, a2);
            }
            res = min(res, cur_res);
        }
    }
    cout << res;
    return 0;
}