{"raw_statement":[{"iden":"problem statement","content":"Takahashi has decided to hold some number of programming contests.  \nHolding one contest requires one $100$\\-point problem, one $200$\\-point problem, one $300$\\-point problem, and one $400$\\-point problem.  \nWhen he has $A_1$, $A_2$, $A_3$, and $A_4$ drafts of $100$\\-, $200$\\-, $300$\\-, and $400$\\-point problems, respectively, at most how many contests can he hold?  \nThe same draft can be used only once."},{"iden":"constraints","content":"*   $1 \\le A_i \\le 100$ $(1 \\le i \\le 4)$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A_1 \\hspace{7pt} A_2 \\hspace{7pt} A_3 \\hspace{7pt} A_4$"},{"iden":"sample input 1","content":"5 3 7 11"},{"iden":"sample output 1","content":"3\n\nBy using three drafts for each slot, he can hold three contests. He has just three drafts for $200$\\-point problems, so he cannot hold four."},{"iden":"sample input 2","content":"100 100 1 100"},{"iden":"sample output 2","content":"1\n\nA contest cannot be held even if there is just one missing slot."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}