Challenges

SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 1957
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 914
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 1565
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 2709
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 1923
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 1373
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 3208
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 2252
Array Sum
You are given an integer array and you have to find the sum of the ele...
Max. Marks: 4
Solved By : 2154
Change in Case
You will be given a single string and two positive integers denoting i...
Max. Marks: 6
Solved By : 1188
Array Sum
Please select a challenge
Problem Statement
You are given an integer array and you have to find the sum of the elements of the array and find the remainder when the sum is divided by the largest number of the array.

Input
First line contains N, the number of elements. Next line contains N space separated integers (elements of the array).

Output
Print the remainder when sum is divided by the maximum element.

Constraints
1 ≤ n ≤ 100 0 ≤ A[i] ≤ 1000

Sample Input
5
1 2 3 4 5

Sample Output

0

Dcoded By: Mrudul Sankhere

Solved By: 2154

Maximum Marks: 4