#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e5;

int n;
char s[MAXN + 5];

int sta[MAXN + 5], top;
int rpair[MAXN + 5];

bool isl(char c) { // is letter
	return c >= 'a' && c <= 'z';
}
char ver(char c) {
	if (c == 'q') {
		return 'p';
	} else if (c == 'p') {
		return 'q';
	} else if (c == 'b') {
		return 'd';
	} else if (c == 'd') {
		return 'b';
	} else {
		assert(c == 'x' || c == 'o');
		return c;
	}
}
char hor(char c) {
	if (c == 'q') {
		return 'd';
	} else if (c == 'p') {
		return 'b';
	} else if (c == 'b') {
		return 'p';
	} else if (c == 'd') {
		return 'q';
	} else {
		assert(c == 'x' || c == 'o');
		return c;
	}
}

struct Element {
	int l, r;
	bool rev, v, h;
	char c;
	Element(char _c) {
		l = r = -1;
		rev = v = h = 0;
		c = _c;
	}
	Element(int _l, int _r, int _op) {
		l = _l;
		r = _r;
		if (_op == 1) {
			rev = 1;
			v = 1;
			h = 0;
		} else {
			rev = 0;
			v = 0;
			h = 1;
		}
		c = 0;
	}
};
// either "a character" or "the result of a substring after all operations"

map<pair<int, int>, vector<Element> > res;

void solve(int l, int r) {
	// cout << "solve " << l << " " << r << endl;
	
	assert(l <= r);
	
	vector<Element> vec;
	
	for (int i = l; i <= r; ++i) {
		if (isl(s[i])) {
			vec.push_back(s[i]);
		} else if (s[i] == '(') {
			if (rpair[i] == i + 1) {
				++i;
				continue;
			}
			solve(i + 1, rpair[i] - 1);
			vec.push_back(Element(i + 1, rpair[i] - 1, 1));
			i = rpair[i];
		} else if (s[i] == '[') {
			if (rpair[i] == i + 1) {
				++i;
				continue;
			}
			solve(i + 1, rpair[i] - 1);
			vec.push_back(Element(i + 1, rpair[i] - 1, 2));
			i = rpair[i];
		} else {
			assert(false);
		}
	}
	
	res[make_pair(l, r)] = vec;
}

void decode(int l, int r, bool rev, bool v, bool h) {
	// cout << "decode " << l << " " << r;
	
	assert(res.count(make_pair(l, r)) != 0);
	vector<Element> vec = res[make_pair(l, r)];
	
	// cout << ", vec.size " << (int)vec.size() << endl;
	
	if (!rev) {
		for (int i = 0; i < (int)vec.size(); ++i) {
			if (vec[i].l == -1) {
				char c = vec[i].c;
				if (v) {
					c = ver(c);
				}
				if (h) {
					c = hor(c);
				}
				
				cout << c;
			} else {
				decode(vec[i].l, vec[i].r, rev ^ vec[i].rev, v ^ vec[i].v, h ^ vec[i].h);
			}
		}
	} else {
		for (int i = (int)vec.size() - 1; i >= 0; --i) {
			if (vec[i].l == -1) {
				char c = vec[i].c;
				if (v) {
					c = ver(c);
				}
				if (h) {
					c = hor(c);
				}
				
				cout << c;
			} else {
				decode(vec[i].l, vec[i].r, rev ^ vec[i].rev, v ^ vec[i].v, h ^ vec[i].h);
			}
		}
	}
}

int main() {
	cin >> (s + 1);
	n = strlen(s + 1);
	
	for (int i = 1; i <= n; ++i) {
		if (s[i] == '(' || s[i] == '[') {
			sta[++top] = i;
		} else if (s[i] == ')') {
			assert(s[sta[top]] == '(');
			rpair[sta[top]] = i;
			--top;
		} else if (s[i] == ']') {
			assert(s[sta[top]] == '[');
			rpair[sta[top]] = i;
			--top;
		}
	}
	
	solve(1, n);
	
	decode(1, n, 0, 0, 0);
	cout << endl;
	
	return 0;
}