EGYPIZZA  Pizza
Abotrika is having a party because his team won the African cup so he is inviting his friends to eat some pizza. Unfortunately, his friends can't eat an entire pizza but all of them know exactly how much pizza they can eat and insist on getting the exact amount of pizza but Abotrika eats one complete pizza and all of them wants his amount of pizza in one slice. Their requests break down to three different pizza sliceseither one quarter or a half or three quarters of pizza.
Write a program that will help Abotrika to find out what is the minimal number of pizzas he has to order so that everyone gets exact amount of pizza they want.
Input
First line contains an integer N, 0 ≤ N ≤ 10 000, the number of friends. In each of next N lines there is amount of pizza that each of Abotrika's friends wants to eat,that is the fraction 1/4, 1/2 or 3/4.
Output
In the first and only line you should write the minimal number of pizzas Abotrika has to order don't forget to order one complete pizza for Abotrika.
Example 1
Input: 3 1/2 3/4 3/4 Output: 4
Example 2
Input: 5 1/2 3/4 1/2 1/4 1/4 Output: 4
hide comments
davidgalehouse:
20160910 22:48:35
@mat_79 Those aren't the correct answers, both are 1 too high. To everyone else, the comments are full of red herrings. I suggest you solve before reading them, unless you get truly stuck. 

mat_79:
20160831 15:32:38
And why is it 3?!?


mat_79:
20160831 14:57:26
Why, oh why it is 7 ?!?


ace_cocytus:
20160822 04:12:33
1. Pizzas 3/4 always take full portion


manish3749:
20160816 19:36:39
try all the test cases given in comments... it will certainly help u 

sharif ullah:
20160813 13:01:13
Just think how we make 1 by using these fraction ........frequencies of fraction helps 

vineetpratik:
20160627 08:52:56
nice question AC in one go thanks to test cases in comments :)


adichd123:
20160314 16:14:34
used frequency array. Last edit: 20160314 16:14:54 

killjee_15:
20160228 16:04:30
Think Simple greedy :p 

rishrocks:
20160131 07:52:28
thanks @ Rajat (1307086): that brilliant test case helps

Added by:  Kawmia Institutes 
Date:  20100818 
Time limit:  0.204s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 BF LISP sbcl LISP clisp JSRHINO LUA OBJC PHP VB.NET 
Resource:  Croatian Highschool Competitions in Informatics 2004 