Challenges

Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 2158
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 2888
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 1442
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 2314
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 3328
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2301
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 1673
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 3868
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 2625
Array Sum
You are given an integer array and you have to find the sum of the ele...
Max. Marks: 4
Solved By : 2601
Stack! Stack! Stack!
Please select a challenge
Problem Statement
Practice your stack data structure. You will be given a series of tasks of push, pop, peek operations to perform on a stack. You need to print the sum of the final stack.

Input
First line contains Q, the number of queries. The next Q lines each contain a query. PUSH queries are accompanied by a positive number N.

Output
Print the topmost element for every 'PEEK' query, each in a newline. Also, print the sum of the remaining elements of the stack in the end in a newline.

Constraints
1 ≤ Q ≤ 50 1 ≤ N ≤ 1000 It is guaranteed that there would be no query of pop or peek operation on an empty stack.

Sample Input
6
PUSH 8
PEEK
POP
PUSH 4
PUSH 3
PEEK

Sample Output

8
3
7

Dcoded By: Mrudul Sankhere

Solved By: 311

Maximum Marks: 9