#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;
int solve(vector<pair<int,int> > v, int st, int nd) {
if(st == nd) return 0;
vector <int> p;
int ans = 0;
for(int i = st; i < nd; i++) {
int a = v[i].first, b = v[i].second;
// cout << a << " " << b << "\n";
ans++;
p.push_back(a);
p.push_back(b);
}
sort(p.begin(), p.end());
int bridge = p[p.size() / 2];
for(auto it:p) {
ans += abs(bridge-it);
}
// cout << "\n";
return ans;
}
void solvek2(){
fast
int n;
cin >> n;
vector <pair<int, int> > p;
int add_ans = 0;
for(int i = 0; i < n; i++) {
char fuck1, fuck2;
int a, b;
cin >> fuck1 >> a >> fuck2 >> b;
if(fuck1 == fuck2) {
add_ans += abs(a - b);
}
else {
p.push_back({min(a, b), max(a, b)});
}
}
sort(p.begin(), p.end(), [&](const pair<int,int>&a, const pair<int,int>&b) {
return ((double)a.first + a.second) / 2 < ((double)b.first + b.second) / 2;
});
int m = p.size();
if(m == 0) {
cout << add_ans << "\n";
return;
}
int ans = inf;
for(int i = 0; i < m; i++) {
int tans = solve(p, 0, i) + solve(p, i, m);
ans = min(ans, tans);
// cout << tans << "\n\n";
}
cout << ans + add_ans << "\n";
}
void solvek1() {
int n;
cin >> n;
vector <int> p;
int ans = 0;
for(int i = 0; i < n; i++) {
char fuck1, fuck2;
int a, b;
cin >> fuck1 >> a >> fuck2 >> b;
if(fuck1 == fuck2) {
ans += abs(a - b);
}
else {
ans += 1;
p.push_back(a);
p.push_back(b);
}
}
sort(p.begin(), p.end());
int bridge = p[p.size() / 2];
for(auto it:p) {
ans += abs(bridge-it);
}
cout << ans << "\n";
}
int32_t main() {
fast
int k;
cin >> k;
if(k == 1) {
solvek1();
}
else {
solvek2();
}
}
