#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

struct node {
	node *l=0,*r=0;
	int lo,hi,va=0,amt=0;
	node() {};
	node(int lo, int hi) : lo(lo), hi(hi) {}
	void push() {
		if (!l) {
			l = new node(lo,(lo+hi)/2);
			r = new node((lo+hi)/2+1,hi);
		}
	}
	void point_add(int I, int X) {
		if (lo == I && I == hi) {
			amt++;
			va += X;
		} else {
			push();
			int m = (lo+hi)/2;
			if (I <= m) {
				l->point_add(I,X);
			} else {
				r->point_add(I,X);
			}
			amt = l->amt + r->amt;
			va = l->va + r->va;
		}
	}
	int range_sum(int L, int R) {
		if (hi < L || R < lo) return 0;
		if (L <= lo && hi <= R) {
			return va;
		}
		push();
		return l->range_sum(L,R) + r->range_sum(L,R);
	}
	int range_cnt(int L, int R) {
		if (hi < L || R < lo) return 0;
		if (L <= lo && hi <= R) {
			return amt;
		}
		push();
		return l->range_cnt(L,R) + r->range_cnt(L,R);
	}
};

const int mxn = 1e5;

int k,n;
array<int,2> br[mxn];
int ans=0;

bool ccb(const array<int,2> &a, const array<int,2> &b) {
	return ((a[0]+a[1]) < (b[0]+b[1]));
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	
	cin>>k>>n; int ci=0;
	for (int i=0; i<n; i++) {
		char t1,t2; int p1,p2;
		cin>>t1>>p1>>t2>>p2;
		if (t1 == t2) {
			ans += abs(p2-p1);
		} else {
			br[ci++]={p1,p2};
			ans++;
		}
	}
	sort(br,br+ci,ccb);
	if (k==1) {
		node rt(0,1e10);
		vector<int> pt;
		for (int i=0; i<ci; i++) {
			int s=br[i][0],e=br[i][1];
			rt.point_add(s,s);
			rt.point_add(e,e);
			pt.push_back(s);
			pt.push_back(e);
		}
		if (sz(pt)) {
			sort(all(pt));
			int m = pt[sz(pt)/2];
			int c1 = rt.range_cnt(0,m);
			int s1 = rt.range_sum(0,m);
			int c2 = rt.range_cnt(m+1,2e9);
			int s2 = rt.range_sum(m+1,2e9);
			cout << m*c1-s1 + s2-m*c2 + ans;
		} else {
			cout << ans;
		}
	}
	
	return 0;
}