There have two numbers n,m and two operators:

1. Cost a second(s), then number add 5

2. Cost b second(s), then number add 1

Please tell Jek The least cost that can make two numbers equal and the numbers can't beyond 10^6. Two numbers' operators are concurrent. 

  Input contains multiple test cases. Each test case start with 4 integers n, m(1<=n, m<=10^6)and a, b(1 <= a, b <= 100).

  For each test case, output the least cost