{"raw_statement":[{"iden":"problem statement","content":"In 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City $1, 2, 3, 4, 5, 6$)!\nThere are five means of transport in this empire:\n\n*   Train: travels from City $1$ to $2$ in one minute. A train can occupy at most $A$ people.\n*   Bus: travels from City $2$ to $3$ in one minute. A bus can occupy at most $B$ people.\n*   Taxi: travels from City $3$ to $4$ in one minute. A taxi can occupy at most $C$ people.\n*   Airplane: travels from City $4$ to $5$ in one minute. An airplane can occupy at most $D$ people.\n*   Ship: travels from City $5$ to $6$ in one minute. A ship can occupy at most $E$ people.\n\nFor each of them, one vehicle leaves the city at each integer time (time $0$, $1$, $2$, $...$).\nThere is a group of $N$ people at City $1$, and they all want to go to City $6$.  \nAt least how long does it take for all of them to reach there? You can ignore the time needed to transfer."},{"iden":"constraints","content":"*   $1 \\leq N, A, B, C, D, E \\leq 10^{15}$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A$\n$B$\n$C$\n$D$\n$E$"},{"iden":"sample input 1","content":"5\n3\n2\n4\n3\n5"},{"iden":"sample output 1","content":"7\n\nOne possible way to travel is as follows. First, there are $N = 5$ people at City $1$, as shown in the following image:\n![image](https://img.atcoder.jp/ghi/9c306138eddc8a2e08acfa5da19bdfe8.png)\nIn the first minute, three people travels from City $1$ to City $2$ by train. Note that a train can only occupy at most three people.\n![image](https://img.atcoder.jp/ghi/bd30b5ab37fc06951c9f5256bb974e4f.png)\nIn the second minute, the remaining two people travels from City $1$ to City $2$ by train, and two of the three people who were already at City $2$ travels to City $3$ by bus. Note that a bus can only occupy at most two people.\n![image](https://img.atcoder.jp/ghi/50f2e49a770a30193fc53588ec8475b3.png)\nIn the third minute, two people travels from City $2$ to City $3$ by train, and another two people travels from City $3$ to City $4$ by taxi.\n![image](https://img.atcoder.jp/ghi/d6d80dc50abe58190905c8c5ea6ba345.png)\nFrom then on, if they continue traveling without stopping until they reach City $6$, all of them can reach there in seven minutes.  \nThere is no way for them to reach City $6$ in $6$ minutes or less."},{"iden":"sample input 2","content":"10\n123\n123\n123\n123\n123"},{"iden":"sample output 2","content":"5\n\nAll kinds of vehicles can occupy $N = 10$ people at a time. Thus, if they continue traveling without stopping until they reach City $6$, all of them can reach there in five minutes."},{"iden":"sample input 3","content":"10000000007\n2\n3\n5\n7\n11"},{"iden":"sample output 3","content":"5000000008\n\nNote that the input or output may not fit into a $32$\\-bit integer type."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}