Problem: You are given two rectangles on a plane. The centers of both rectangles are located in the origin of coordinates (meaning the center of the rectangle's symmetry). The first rectangle's sides are parallel to the coordinate axes: the length of the side that is parallel to the Ox axis, equals w, the length of the side that is parallel to the Oy axis, equals h. The second rectangle can be obtained by rotating the first rectangle relative to the origin of coordinates by angle α.

<image>

Your task is to find the area of the region which belongs to both given rectangles. This region is shaded in the picture.

Input

The first line contains three integers w, h, α (1 ≤ w, h ≤ 106; 0 ≤ α ≤ 180). Angle α is given in degrees.

Output

In a single line print a real number — the area of the region which belongs to both given rectangles.

The answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.

Examples

Input

1 1 45


Output

0.828427125


Input

6 4 30


Output

19.668384925

Note

The second sample has been drawn on the picture above.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int cmpD(double x, double y = 0, double tol = 1e-3) {
  return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
}
struct pt {
  double x, y, r;
  pt(double x = 0, double y = 0) : x(x), y(y) {}
  pt operator+(pt p) { return pt(x + p.x, y + p.y); }
  pt operator-(pt p) { return pt(x - p.x, y - p.y); }
  pt operator*(double c) { return pt(x * c, y * c); }
  pt operator/(double c) { return pt(x / c, y / c); }
  double operator*(pt p) { return x * p.x + y * p.y; }
  double operator%(pt p) { return x * p.y - y * p.x; }
  int cmp(pt p) const {
    int t = cmpD(x, p.x);
    return t ? t : cmpD(y, p.y);
  }
  bool operator==(pt p) { return cmp(p) == 0; }
  bool operator!=(pt p) { return cmp(p) != 0; }
  bool operator<(const pt &p) const { return cmp(p) < 0; }
  bool operator>(const pt &p) const { return cmp(p) > 0; }
  bool operator<=(const pt &p) const { return cmp(p) <= 0; }
  bool operator>=(const pt &p) const { return cmp(p) >= 0; }
  friend ostream &operator<<(ostream &o, pt p) {
    return o << "(" << p.x << "," << p.y << ")";
  }
  int prod(pt p, pt q) { return cmpD((*this - p) % (q - p)); }
  bool between(pt p, pt q) {
    return prod(p, q) == 0 && min(p, q) <= *this && *this <= max(p, q);
  }
  bool left(pt p, pt q) { return prod(p, q) < 0; }
  bool right(pt p, pt q) { return prod(p, q) > 0; }
};
pt pivot;
pt rotate(pt a, double teta, pt o = pt()) {
  a = a - o;
  pt cis(cos(teta), sin(teta));
  return o + pt(a.x * cis.x - a.y * cis.y, a.x * cis.y + a.y * cis.x);
}
pt line_intersect(pt p, pt q, pt r, pt s) {
  pt a = q - p, b = s - r, c(p % q, r % s);
  if (cmpD(a % b) == 0) return pt(1e18, 1e18);
  return pt(pt(a.x, b.x) % c, pt(a.y, b.y) % c) / (a % b);
}
bool seg_intersect(pt p, pt q, pt r, pt s) {
  if (r.between(p, q) || s.between(p, q) || p.between(r, s) || q.between(r, s))
    return true;
  pt a = line_intersect(p, q, r, s);
  return a.between(p, q) && a.between(r, s);
}
bool radial_lt(pt p, pt q) {
  pt P = p - pivot, Q = q - pivot;
  double R = P % Q;
  if (cmpD(R)) return cmpD(R) > 0;
  return cmpD(P * P, Q * Q) > 0;
}
vector<pt> convex_hull(vector<pt> T) {
  int i, j = 0, k, n = T.size();
  vector<pt> U(n);
  pivot = *min_element((T).begin(), (T).end());
  sort((T).begin(), (T).end(), radial_lt);
  for (k = n - 2; k >= 0 && T[0].prod(T[k], T[n - 1]) == 0; k--)
    ;
  reverse((k + 1) + (T).begin(), (T).end());
  for (i = 0; i < n; i++) {
    while (j > 1 && T[i].prod(U[j - 1], U[j - 2]) <= 0) j--;
    U[j++] = T[i];
  }
  U.erase(j + (U).begin(), (U).end());
  return U;
}
double poly_area(vector<pt> T) {
  double s = 0;
  int i, n = T.size();
  for (i = 0; i < n; i++) s += fabs(T[i] % T[(i + 1) % n]);
  return s / 2;
}
vector<pt> A(4), B(4), inter;
int main() {
  double h, w, teta;
  int i, j;
  scanf("%lf %lf %lf", &w, &h, &teta);
  if (cmpD(teta) == 0 || cmpD(teta, 180) == 0) {
    printf("%.9lf\n", w * h);
    return 0;
  }
  teta = teta * acos(0) / 90;
  A[0] = pt(-w / 2, -h / 2);
  A[1] = pt(w / 2, -h / 2);
  A[2] = pt(w / 2, h / 2);
  A[3] = pt(-w / 2, h / 2);
  for (i = 0; i < 4; i++) B[i] = rotate(A[i], teta);
  for (i = 0; i < 4; i++)
    for (j = 0; j < 4; j++)
      if (seg_intersect(A[i], A[(i + 1) % 4], B[j], B[(j + 1) % 4]))
        inter.push_back(
            line_intersect(A[i], A[(i + 1) % 4], B[j], B[(j + 1) % 4]));
  printf("%.9lf\n", poly_area(convex_hull(inter)));
  return 0;
}