/*  This Code is Submitted by wywcgs for Problem 2287 on 2006-06-19 at 00:21:19 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int L = 10240;
const char ROM[] = "~ivxlcdm";
const int V[] = { 0, 1, 5, 10, 50, 100, 500, 1000 };

char str[L];
int tn;
bool nxt;

int find(int&, int);

int main()
{
	int i, v[128] = { 0 };

	for(i = 1; i < 8; i++) v[ROM[i]] = i;
	while(gets(str) != NULL) {
		int tv = tn = 0, id = 0; nxt = true;
		for(i = 0; str[i] != 0; i++) {
			if(v[str[i]] != 0) str[tn++] = str[i];
			if(str[i] == 'm') { tv += 1000; id = tn; }
		}
		for(i = 6; i > 0; i--) tv += find(id, i);
		printf("%d\n", tv);
	}
	
	return 0;
}

int find(int& id, int o)
{
	int k = o&1, td = 0, i;
	if(k == 0) {
		if(!nxt) return 0;
		for(i = id; i < tn; i++)
			if(str[i] == ROM[o]) { id = i+1; return V[o]; }
		return 0;
	} else {
		if(nxt) {
			for(i = id; i < tn && td < 3; i++)
				if(str[i] == ROM[o]) { td++; id = i+1; }
			if(td < 3 || o == 1) return td*V[o];
		}
		if(o == 1) return 0;
		bool pa = false; nxt = true;
		for(i = id; i < tn; i++)
			if(str[i] == ROM[o-2]) pa = true;
			else if(pa && str[i] == ROM[o]) { nxt = false; id = i+1; return (td+1)*V[o]-V[o-2]; }
		return td*V[o];
	}
}