#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

int main() {
	string s;
	while (cin >> s){
		vector<int> num;
		REP(i, s.length()){
			int a;
			if (s[i] == 'I')
				a = 1;
			if (s[i] == 'V')
				a = 5;
			if (s[i] == 'X')
				a = 10;
			if (s[i] == 'L')
				a = 50;
			if (s[i] == 'C')
				a = 100;
			if (s[i] == 'D')
				a = 500;
			if (s[i] == 'M')
				a = 1000;
			num.push_back(a);
		}
		int ans = 0;
		REP(i,num.size()){
			
			if (i==num.size()-1||num[i] >= num[i + 1]){
				ans += num[i];
			}
			else{
				ans += num[i + 1] - num[i];
				i++;
			}
		}
		cout << ans << endl;
	}
}