#P1774F1. Magician and Pigs (Easy Version)
-
ID: 411
Type: RemoteJudge
2000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: 9
Uploaded By:
Hydro
Tags> Magician and Pigs (Easy Version)
Description
This is the easy version of the problem. The only difference between the two versions is the constraint on and . You can make hacks only if both versions of the problem are solved.
Little09 has been interested in magic for a long time, and it's so lucky that he meets a magician! The magician will perform operations, each of them is one of the following three:
- : Create a pig with Health Points.
- : Reduce the Health Point of all living pigs by .
- : Repeat all previous operations. Formally, assuming that this is the -th operation in the operation sequence, perform the first operations (including "Repeat" operations involved) in turn.
A pig will die when its Health Point is less than or equal to .
Little09 wants to know how many living pigs there are after all the operations. Please, print the answer modulo .
The first line contains a single integer () — the number of operations.
Each of the following lines contains an operation given in the form described in the problem statement. It's guaranteed that in operations of the first two types.
Print a single integer — the number of living pigs after all the operations, modulo .
Input
The first line contains a single integer () — the number of operations.
Each of the following lines contains an operation given in the form described in the problem statement. It's guaranteed that in operations of the first two types.
Output
Print a single integer — the number of living pigs after all the operations, modulo .
Note
In the first example, the operations are equivalent to repeating four times: create a pig with Health Points and then reduce the Health Points of all living pigs by . It is easy to find that there are two living pigs in the end with and Health Points.