Codeforces A. Trip For Meal

A. Trip For Meal

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives in his own house. There are winding paths between each pair of houses. The length of a path between Rabbit's and Owl's houses is a meters, between Rabbit's and Eeyore's house is b meters, between Owl's and Eeyore's house is cmeters.

For enjoying his life and singing merry songs Winnie-the-Pooh should have a meal n times a day. Now he is in the Rabbit's house and has a meal for the first time. Each time when in the friend's house where Winnie is now the supply of honey is about to end, Winnie leaves that house. If Winnie has not had a meal the required amount of times, he comes out from the house and goes to someone else of his two friends. For this he chooses one of two adjacent paths, arrives to the house on the other end and visits his friend. You may assume that when Winnie is eating in one of his friend's house, the supply of honey in other friend's houses recover (most probably, they go to the supply store).

Winnie-the-Pooh does not like physical activity. He wants to have a meal n times, traveling minimum possible distance. Help him to find this distance.

Input

First line contains an integer n (1 ≤ n ≤ 100) — number of visits.

Second line contains an integer a (1 ≤ a ≤ 100) — distance between Rabbit's and Owl's houses.

Third line contains an integer b (1 ≤ b ≤ 100) — distance between Rabbit's and Eeyore's houses.

Fourth line contains an integer c (1 ≤ c ≤ 100) — distance between Owl's and Eeyore's houses.

Output

Output one number — minimum distance in meters Winnie must go through to have a meal n times.

Examples

input

3
2
3
1

output

3

input

1
2
3
5

output

0

Note

In the first test case the optimal path for Winnie is the following: first have a meal in Rabbit's house, then in Owl's house, then in Eeyore's house. Thus he will pass the distance 2 + 1 = 3.

In the second test case Winnie has a meal in Rabbit's house and that is for him. So he doesn't have to walk anywhere at all.

每次走最短的距离就行了；

代码写的有点长；

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
 
int n,d,b,c,a[][],ans;
 
int main(){
    scanf("%d",&n);
    n--;
    scanf("%d%d%d",&d,&b,&c);
    a[][]=d;
    a[][]=b;
    a[][]=d;
    a[][]=c;
    a[][]=b;
    a[][]=c;
    int u=;
    for(int i=;i<=n;i++){
        if(u==){
        if(a[u][]<a[u][]){
            ans+=a[u][];
            u=;
            continue;
        }else{
            ans+=a[u][];
            u=;
            continue;
        }
        }
        if(u==){
        if(a[u][]<a[u][]){
            ans+=a[u][];
            u=;
            continue;
        }else{
            ans+=a[u][];
            u=;
            continue;
        }
        }
        if(u==){
        if(a[u][]<a[u][]){
            ans+=a[u][];
            u=;
            continue;
        }else{
            ans+=a[u][];
            u=;
            continue;
        }
        }
    }
    printf("%d",ans);
}