/* Generated by the powerful Sio Tool
 * You can download the binary file here: https://github.com/Arapak/sio-tool
 * Author:  (Karol Bonat)
 * Time of creation: 2024-03-19 10:29:46
 * Notes: 
**/

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

constexpr int MAXN = 1000006;

int n, M;
int m, f;

bool tab[MAXN];
bool test(int lim){
	int mc = m;
	int fc = f;

	int mf = (n/2-m);
	int mr=0, fr=0;
	for(int i = 1; i <= n; i){
		if(tab[i] && fr){
			fr--; i++; continue;
		}
		if(!tab[i] && mr){
			mr--; i++; continue;
		}
		int j = i+1;
		while(tab[i] && fr){
			fr--; j++;
		}
		while(!tab[i] && mr){
			mr--; j++;
		}
		if(tab[i] && tab[j] && mr < lim && mc){
			mr++;
			mc--;
			fc--;
			i=j;
			continue;
		}
		if(tab[i] && tab[j]){
			//We failed to joink (probably cnt=lim), try to push it through
			if(mf){
				i=j+1;
				mf--;
				fc-=2;
				continue;
			}
			else{
				return 0;
			}
		}
		if(!tab[i] && !tab[j]){
			//We automatically joink a fem
			if(fc){
				fr++;
				fc--;
				mc--;
				i=j;
				continue;
			}
			else{
				return 0;
			}
		}
		//We hae male-female, nothing happens
		fc--;
		mc--;
		i=j+1;
	}
	return 1;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> M;
	string s;
	while(M--){
		string t; int k;
		cin >> t >> k;
		while(k--){
			s+=t;
		}
	}
	for(char t : s){
		m+=t=='M';
		f+=t=='F';
	}
	if(m > n){
		cout << "-1\n";
		return 0;
	}
	n*=2;
	for(int i = 1; i <= n; i++){
		tab[i] = s[i-1]=='F';
	}

	//Motha fucka
	int p = 0, k = n;
	while(p <= k){
		int s = (p+k)/2;
		if(test(s)){
			k=s-1;
		}
		else{
			p=s+1;
		}
	}
	cout << p << '\n';
	return 0;
}