#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, s != "#"){
		stack<bool> sb;
		while (s.length()){
			if (s[0] == 'n'){
				s.erase(0, 5);
				sb.push(false);
			}
			else if (s[0] =='w' ){
				s.erase(0, 4);
				sb.push(true);
			}
		}
		int d = (int)pow(2,sb.size()-2);
		int a = 0;
		int c = -100;
		if (sb.size() > 2){
			while (!sb.empty()){
				bool b = sb.top();
				a *= 2;
				if (b){
					a += 45;	
				}
				else{
					a -= 45;
					if (a < 0)a = 0;
				}
				
				sb.pop();
			}
			cout << a << "/" << d << endl;
		}
		else if(sb.size()==2){
			cout << 45 << endl;
		}
else{
			if (sb.top())a = 90;
			if (!sb.top())a = 0;
			cout << a << endl;
		}
		
		
	}
}