1 #include <cstdio>
 2 #include <cstring>
 3 #include <string>
 4 #include <queue>
 5 #include <iostream>
 6 using namespace std;
 7 char s[105];
 8 struct node{
 9     int w;
10     char c;
11 };
12 node stack[105];
13 int main(){
14     //freopen("D:\\INPUT.txt","r",stdin);
15     while(scanf("%s",s)!=EOF){
16         int i,top=0;
17
18         //cout<<s<<endl;
19
20         for(i=0;i<strlen(s);i++){
21             if(s[i]=='('){
22                 stack[top].c='(';
23                 stack[top++].w=i;
24
25                 //cout<<s[i]<<" "<<i<<" "<<top<<endl;
26
27             }
28             else{
29                 if(s[i]==')'){
30                         if(!top||stack[top-1].c!='('){//没有元素
31                             stack[top].c=')';
32                             stack[top++].w=i;
33                         }
34                         else{
35                             top--;
36                         }
37                     }
38                 }
39             }
40         cout<<s<<endl;
41
42         //cout<<top<<endl;
43
44         for(i=0;i<top;i++){
45             if(stack[i].c==')'){
46                 s[stack[i].w]='?';
47             }
48             else{
49                 s[stack[i].w]='$';
50             }
51         }
52         //cout<<s<<endl;
53         for(i=0;i<strlen(s);i++){
54             if(s[i]=='?'||s[i]=='$'){
55                 cout<<s[i];
56             }
57             else{
58                 cout<<' ';
59             }
60         }
61         cout<<endl;
62     }
63     return 0;
64 }