Back
Close

Display the squad !

Statement

 Goal

No statement (Reverse mode)
Input
A line containing one positive integer N .
N can be written under the form N = 1 + 4 X
Output
A single line displaying the full squad
Constraints
N can be written as N = 1 + 4 X
1 < N < 402
0 <= X <= 100
Example
Input
9
Output
(-(-(-_(-_(-_-)_-)_-)-)-)

Game modes
Reverse

Test cases
Test 1 Test
Input
9
Output
(-(-(-_(-_(-_-)_-)_-)-)-)

Validator 1 Validator
Input
25
Output
(-(-(-(-(-(-(-_(-_(-_(-_(-_(-_(-_-)_-)_-)_-)_-)_-)_-)-)-)-)-)-)-)

Test 2 Test
Input
1
Output
(-_-)

Validator 2 Validator
Input
1
Output
(-_-)

Test 3 Test
Input
5
Output
(-(-_(-_-)_-)-)

Validator 3 Validator
Input
17
Output
(-(-(-(-(-_(-_(-_(-_(-_-)_-)_-)_-)_-)-)-)-)-)

Test 4 Test
Input
13
Output
(-(-(-(-_(-_(-_(-_-)_-)_-)_-)-)-)-)

Validator 4 Validator
Input
41
Output
(-(-(-(-(-(-(-(-(-(-(-_(-_(-_(-_(-_(-_(-_(-_(-_(-_(-_-)_-)_-)_-)_-)_-)_-)_-)_-)_-)_-)-)-)-)-)-)-)-)-)-)-)

Solution language

Solution

Stub generator input