#include <bits/stdc++.h>
using namespace std;
 
void smallestNumber(string pattern) {
	stack<int> stack;
	string num;
	for(int i=0; i<=pattern.length(); i++) {
		stack.push(i+1);
		if(pattern[i] == 'I' || i == pattern.length()) {
			while(!stack.empty()) {
				num += stack.top() + '0';
				stack.pop();
			}
		}
		// cout << num << endl;
	}
	cout << num << endl;
}
 
int main() {
	string input;
	for(int i=0; i<4; i++) {
		cin >> input;
		smallestNumber(input);
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2b2lkIHNtYWxsZXN0TnVtYmVyKHN0cmluZyBwYXR0ZXJuKSB7CglzdGFjazxpbnQ+IHN0YWNrOwoJc3RyaW5nIG51bTsKCWZvcihpbnQgaT0wOyBpPD1wYXR0ZXJuLmxlbmd0aCgpOyBpKyspIHsKCQlzdGFjay5wdXNoKGkrMSk7CgkJaWYocGF0dGVybltpXSA9PSAnSScgfHwgaSA9PSBwYXR0ZXJuLmxlbmd0aCgpKSB7CgkJCXdoaWxlKCFzdGFjay5lbXB0eSgpKSB7CgkJCQludW0gKz0gc3RhY2sudG9wKCkgKyAnMCc7CgkJCQlzdGFjay5wb3AoKTsKCQkJfQoJCX0KCQkvLyBjb3V0IDw8IG51bSA8PCBlbmRsOwoJfQoJY291dCA8PCBudW0gPDwgZW5kbDsKfQoKaW50IG1haW4oKSB7CglzdHJpbmcgaW5wdXQ7Cglmb3IoaW50IGk9MDsgaTw0OyBpKyspIHsKCQljaW4gPj4gaW5wdXQ7CgkJc21hbGxlc3ROdW1iZXIoaW5wdXQpOwoJfQoJcmV0dXJuIDA7Cn0=

SUlJRElEREQKSUlECkRERApJSUlESURE

IIIDIDDD
IID
DDD
IIIDIDD