// https://oj.uz/problem/view/APIO15_bridge
#ifndef DEBUG
#pragma GCC optimize("Ofast,unroll-loops")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#if defined(DEBUG) && defined(DEBUG_UTIL)
#include "dsa_util.h"
#endif
// clang-format off
using namespace std;
using namespace __gnu_pbds;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr int INF = 0x3f3f3f3f;
constexpr ll INFL = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-9;
constexpr int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
constexpr int dy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
constexpr int drev[8] = {1, 0, 3, 2, 7, 6, 5, 4};
constexpr int drotl[8] = {2, 3, 1, 0, 6, 4, 7, 5};
constexpr int drotr[8] = {3, 2, 0, 1, 5, 7, 4, 6};
constexpr char dn_nsew[4] = {'S', 'N', 'E', 'W'};
constexpr char dn_udrl[4] = {'D', 'U', 'R', 'L'};
unordered_map<char, int> dm_nsew = {{'S', 0}, {'N', 1}, {'E', 2}, {'W', 3}};
unordered_map<char, int> dm_udrl = {{'D', 0}, {'U', 1}, {'R', 2}, {'L', 3}};
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#if __cplusplus < 202002L
template <typename T> int popcount(T x); template <> int popcount(uint x) { return __builtin_popcount(x); } template <> int popcount(ull x) { return __builtin_popcountll(x); }
template <typename T> int countl_zero(T x); template <> int countl_zero(uint x) { return __builtin_clz(x); } template <> int countl_zero(ull x) { return __builtin_clzll(x); }
template <typename T> int countr_zero(T x); template <> int countr_zero(uint x) { return __builtin_ctz(x); } template <> int countr_zero(ull x) { return __builtin_ctzll(x); }
template <typename T> int bit_width(T x) { return numeric_limits<T>::digits - countl_zero(x); }
#endif
template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }
template <typename T> T randint(T l, T r) { return uniform_int_distribution<T>(l, r)(rng); }
template <typename T> T randf(T l, T r) { return uniform_real_distribution<T>(l, r)(rng); }
template <typename T> int log2if(T x) { return bit_width(x) - 1; }
template <typename T> int log2ic(T x) { return bit_width(x - 1); }
bool inside(int x, int y, int n, int m) { return x >= 0 && x < n && y >= 0 && y < m; }
ll sqdist(const pair<int, int> &p, const pair<int, int> &q) { ll x = p.first - q.first, y = p.second - q.second; return x * x + y * y; }
template <typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<>>;
template <typename T, typename Comp = less<>> using ordered_set = tree<T, null_type, Comp, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T = null_type> using pref_trie = trie<string, T, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update>;
#if __cplusplus >= 201703L
template <typename, typename = void> struct is_iterable : false_type {};
template <typename T> struct is_iterable<T, void_t<decltype(declval<T>().begin()), decltype(declval<T>().end())>> : true_type {};
template <> struct is_iterable<string> : false_type {};
template <typename T> constexpr bool is_iterable_v = is_iterable<T>::value;
template <typename T, typename V = enable_if_t<is_iterable_v<T>, typename T::value_type>> ostream &operator<<(ostream &os, const T &t) { for (const V &v : t) os << v << ' '; return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << '(' << p.first << ' ' << p.second << ')'; }
void dbg_header_(const char *f, int l, const char *e) { cout << "\033[35m(" << f << ':' << l << ") \033[1m" << e << ":\033[0m "; }
template <typename T, typename = enable_if_t<!is_iterable_v<T>>> void dbg_(const T &t, const char *f, int l, const char *e) { dbg_header_(f, l, e); cout << "\033[33;1m" << t << "\033[0m" << endl; }
template <typename T, typename V = enable_if_t<is_iterable_v<T> && !is_iterable_v<typename T::value_type>, typename T::value_type>, typename = void> void dbg_(const T &t, const char *f, int l, const char *e) { dbg_header_(f, l, e); cout << "\033[33;1m"; for (const V &v : t) cout << v << ' '; cout << "\033[0m" << endl; }
template <typename T, typename = enable_if_t<is_iterable_v<T> && is_iterable_v<typename T::value_type>, typename T::value_type>, typename = void, typename = void> void dbg_(const T &t, const char *f, int l, const char *e) { dbg_header_(f, l, e); cout << '\n'; for (int i = 0; i < t.size(); i++) cout << "\033[36m" << i << ":\033[33;1m " << t[i] << "\033[0m" << endl; }
#ifdef DEBUG
#define dbg(t) dbg_((t), __func__, __LINE__, #t)
#else
#define dbg(t)
#endif
#endif
// clang-format on
void solve()
{
#ifdef DEBUG
cout << "\033[31;1m======================================================================\033[0m" << endl;
#endif
int k, n;
cin >> k >> n;
ll same = 0;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++)
{
char p, q;
int s, t;
cin >> p >> s >> q >> t;
if (p == q)
same += abs(t - s);
else
v.emplace_back(s, t);
}
ranges::sort(v, [](const pair<int, int> &a, const pair<int, int> &b)
{
return a.first + a.second < b.first + b.second;
});
n = v.size();
same += n;
vector<ll> p(n + 1);
multiset<int> sl, sh;
ll tl = 0, th = 0;
auto insert = [&](int x)
{
int m = sl.empty() ? INF : *sl.rbegin();
if (x <= m)
{
sl.insert(x);
tl += x;
}
else
{
sh.insert(x);
th += x;
}
if (sh.size() + 1 < sl.size())
{
int t = *sl.rbegin();
sl.erase(--sl.end());
sh.insert(t);
tl -= t;
th += t;
}
else if (sl.size() < sh.size())
{
int t = *sh.begin();
sh.erase(sh.begin());
sl.insert(t);
th -= t;
tl += t;
}
};
for (int i = 0; i < n; i++)
{
insert(v[i].first);
insert(v[i].second);
p[i + 1] = th - tl;
}
ll ans = p[n];
if (k == 2)
{
sl.clear();
sh.clear();
tl = th = 0;
for (int i = n - 1; i >= 0; i--)
{
insert(v[i].first);
insert(v[i].second);
ans = min(ans, th - tl + p[i]);
}
}
cout << ans + same << endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
// cin >> t;
while (t--)
solve();
}
