5 3 2 4 3 5
7 One possible way to travel is as follows. First, there are $N = 5$ people at City $1$, as shown in the following image:  In 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.  In 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.  In 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.  From then on, if they continue traveling without stopping until they reach City $6$, all of them can reach there in seven minutes. There is no way for them to reach City $6$ in $6$ minutes or less.
10 123 123 123 123 123
5 All 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.
10000000007 2 3 5 7 11
5000000008 Note that the input or output may not fit into a $32$\-bit integer type.
{
"problem": {
"name": "Five Transportations",
"description": {
"content": "In 2028 and after a continuous growth, AtCoder Inc. finally built an empire with six cities (City $1, 2, 3, 4, 5, 6$)! There are five means of transport in this empire: * Train: travels from City $",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc123_c"
},
"statements": [
{
"statement_type": "Markdown",
"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 $...",
"is_translate": false,
"language": "English"
}
]
}