#include <stdio.h>
#include <string.h>
#include <unistd.h>
#define MAX 10000

char pole[MAX];
//char cislo[MAX];
int vysledek;
int nasIndex;
int lastM;

char low(char c)
{
	if (c>='A' && c<='Z')
	{
		c -= 'A' - 'a';
	}
	return c;
}


int prvni(char c, int nasIndex)
{
	for (unsigned int i = nasIndex ; i <MAX; i++)
	{
		if (pole[i]==c)
			return i;
	}
	return -1;
}


int najdi(char c, int body, int times)
{
//	printf("Hledam %c %d\n", c, nasIndex);
	int localIndex = nasIndex;
	int found = 0;
	if (nasIndex < MAX)
	{
		while (found < times)
		{
			if (low(pole[localIndex]) == c)
			{
				vysledek += body;
	//			printf("Found %c I:%d B:%d\n", c, localIndex, vysledek);
				found ++;
				lastM = localIndex;
				nasIndex = localIndex;
			}
			localIndex++;
			if (localIndex== MAX)
			{
				return 0;
			}
		}
	}
	return 0;
}

int posledni(char c)
{
	for (unsigned int i = MAX -1 ; i >=0; i--)
	{
		if (pole[i]==c)
			return i;
	}
	return 0;
}


void fuj()
{
	najdi('m', 1000, MAX);
	nasIndex = lastM;
	najdi('d', 500, 1);
	najdi('c', 100, 3);
	najdi('l', 50, 1);
	najdi('x', 10, 3);
	najdi('v', 5, 1);
	najdi('i', 1, 3);

	//printf("%s %d\n", pole, vysledek);
	printf("%d\n", vysledek);
}

/*void sito()
{
	int nalezeno = 0;
	for (unsigned int i=0; i<strlen(pole); i++)
	{
		if ((pole[i] == 'i') || (pole[i] == 'v') || (pole[i] == 'x') || (pole[i] == 'l') || (pole[i] == 'c') || (pole[i] == 'd') || (pole[i] == 'm')) 
		{
			cislo[nalezeno++] = pole[i];
		}
	}
	cislo[nalezeno]='\0';
}*/
void lowercase()
{
	for (int i =0; i<MAX; i++)
	{
		pole[i] = low(pole[i]);
	}
}

void initialize()
{
	for (unsigned int i = 0; i< MAX; i++)
	{
		pole[i] = 0;
		//cislo[i] = 0;
		vysledek = 0;
		nasIndex = 0;
		lastM = 0;
	}
		
}
int main(void)
{
	initialize();
	//while (read(0,pole) != 0)
	while (gets(pole))
	{
//		lowercase();
//		sito();
		fuj();
		initialize();
	}

	return 0;
}