Problem: After waking up at hh:mm, Andrew realised that he had forgotten to feed his only cat for yet another time (guess why there's only one cat). The cat's current hunger level is H points, moreover each minute without food increases his hunger by D points.

At any time Andrew can visit the store where tasty buns are sold (you can assume that is doesn't take time to get to the store and back). One such bun costs C roubles and decreases hunger by N points. Since the demand for bakery drops heavily in the evening, there is a special 20% discount for buns starting from 20:00 (note that the cost might become rational). Of course, buns cannot be sold by parts.

Determine the minimum amount of money Andrew has to spend in order to feed his cat. The cat is considered fed if its hunger level is less than or equal to zero.

Input

The first line contains two integers hh and mm (00 ≤ hh ≤ 23, 00 ≤ mm ≤ 59) — the time of Andrew's awakening.

The second line contains four integers H, D, C and N (1 ≤ H ≤ 105, 1 ≤ D, C, N ≤ 102).

Output

Output the minimum amount of money to within three decimal digits. You answer is considered correct, if its absolute or relative error does not exceed 10 - 4.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if <image>.

Examples

Input

19 00
255 1 100 1


Output

25200.0000


Input

17 41
1000 6 15 11


Output

1365.0000

Note

In the first sample Andrew can visit the store at exactly 20:00. The cat's hunger will be equal to 315, hence it will be necessary to purchase 315 buns. The discount makes the final answer 25200 roubles.

In the second sample it's optimal to visit the store right after he wakes up. Then he'll have to buy 91 bins per 15 roubles each and spend a total of 1365 roubles.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long modInverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long gcd(long long a, long long b) {
  if (a % b == 0)
    return b;
  else
    return gcd(b, a % b);
}
long long power(long long x, long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return power(x, y / 2) * power(x, y / 2);
  else
    return x * power(x, y / 2) * power(x, y / 2);
}
long long Log2n(long long n) { return (n > 1) ? 1 + Log2n(n / 2) : 0; }
long long powermod(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void createseg(vector<long long> a[], long long i, long long n, long long l,
               long long r, long long b[]) {
  a[i].push_back(l);
  a[i].push_back(r);
  long long m = (l + r) / 2;
  if (i <= n) {
    createseg(a, 2 * i, n, l, m, b);
    if (r >= m + 1) createseg(a, 2 * i + 1, n, m + 1, r, b);
  }
  if (l == r) {
    a[i].push_back(b[l - 1]);
  }
  if (r > l) {
    int x = 2, y = 2, z = 2;
    while (z - 2 < r - l + 1 && z - 2 <= 52) {
      if (x < a[2 * i].size() && y < a[2 * i + 1].size()) {
        if (a[2 * i][x] > a[2 * i + 1][y]) {
          a[i].push_back(a[2 * i][x]);
          ++x;
        } else {
          a[i].push_back(a[2 * i + 1][y]);
          ++y;
        }
      } else {
        if (x == a[2 * i].size()) {
          while (y < a[2 * i + 1].size()) {
            a[i].push_back(a[2 * i + 1][y]);
            ++y;
            ++z;
          }
        } else {
          while (x < a[2 * i].size()) {
            a[i].push_back(a[2 * i][x]);
            ++x;
            ++z;
          }
        }
      }
      ++z;
    }
  }
}
void upseg(vector<long long> a[], long long i, long long y, long long n,
           long long value) {
  if (i <= 2 * n) {
    long long l = a[i][0], r = a[i][1];
    long long m = (a[i][0] + a[i][1]) / 2;
    if (y <= m && l != r) {
      upseg(a, 2 * i, y, n, value);
    }
    if (y > m && l != r) {
      upseg(a, 2 * i + 1, y, n, value);
    }
    if (l == r) {
      a[i][2] = value;
    } else {
      int x = 2, y = 2, z = 2;
      while (z - 2 < r - l + 1 && z - 2 <= 52) {
        if (x < a[2 * i].size() && y < a[2 * i + 1].size()) {
          if (a[2 * i][x] > a[2 * i + 1][y]) {
            a[i][z] = a[2 * i][x];
            ++x;
            ++z;
          } else {
            a[i][z] = a[2 * i + 1][y];
            ++y;
            ++z;
          }
        } else {
          if (x == a[2 * i].size()) {
            while (y < a[2 * i + 1].size()) {
              a[i][z] = a[2 * i + 1][y];
              ++y;
              ++z;
            }
          } else {
            while (x < a[2 * i].size()) {
              a[i][z] = a[2 * i][x];
              ++x;
              ++z;
            }
          }
        }
        if (x >= a[2 * i].size() && y >= a[2 * i + 1].size()) break;
      }
    }
  }
}
void ansseg(vector<long long> a[], long long l, long long r, long long b[],
            long long i, vector<long long> &va) {
  if (a[i][0] == l && a[i][1] == r) {
    for (int j = 2; j < a[i].size(); ++j) {
      va.push_back(a[i][j]);
    }
  } else {
    long long m = (a[i][0] + a[i][1]) / 2;
    if (l <= m && r > m) {
      ansseg(a, l, m, b, 2 * i, va);
      ansseg(a, m + 1, r, b, 2 * i + 1, va);
    }
    if (l <= m && r <= m) ansseg(a, l, r, b, 2 * i, va);
    if (l > m && r > m) ansseg(a, l, r, b, 2 * i + 1, va);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int hh, m;
  cin >> hh >> m;
  int h, d, n;
  double c;
  cin >> h >> d >> c >> n;
  if (hh >= 20) {
    cout << fixed << setprecision(8) << (c * 4 * (ceil(((double)h) / n))) / 5;
  } else {
    double ans1, ans2;
    ans1 = (c * (ceil(((double)h) / n)));
    int t = 20 - hh;
    t *= 60;
    t -= m;
    ans2 = (c * 4 * (ceil(((double)h + d * t) / n))) / 5;
    if (ans2 > ans1) {
      cout << fixed << setprecision(8) << ans1;
    } else
      cout << fixed << setprecision(8) << ans2;
  }
}