Rabbits In The Forest

medium

Hashmap and Heaps

Question Solve Solutions

1. There are some rabbits in the forest and each rabbit has some color.
2. Some(possibly all) rabbits are selected from them and they tell you about the number of other rabbits having the same color as them.
3. You are given an array(arr) that contains the answers of all selected rabbits.
4. You have to find the minimum number of rabbits that could be in the forest.

Input Format

A number N arr1 arr2.. N numbers

Output Format

A number representing the minimum number of rabbits in the forest.

Constraints

1 <= N <= 1000
0 <= arr[i] <= 1000

Example

Input

5
1 0 1 0 0

Output

Recurring Sequence In A Fraction

Maximum Points On A Line

Related Questions

easy Double Pair Array easy Subdomain Visit Count easy Group Anagrams easy Isomorphic Strings easy Valid Anagram easy Longest Subarray With Sum Divisible By K easy The Skyline Problem easy Word Pattern easy Number Of Employees Under Every Manager easy Find Itinerary From Tickets easy Check If An Array Can Be Divided Into Pairs Whose Sum Is Divisible By K easy Largest Subarray With Zero Sum easy Count Distinct Elements In Every Window Of Size K easy Largest Subarray With Contiguous Elements medium Count Of All Subarrays With Zero Sum hard Smallest Substring Of A String Containing All Characters Of Another String