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;
const double EPS = 0.000005;
bool compare(double a, double b) {
  if (a - b < EPS && a - b > -EPS) return 1;
  return 0;
}
struct Point {
  double x, y;
  Point(double x, double y) : x(x), y(y){};
  Point() {}
};
struct Line {
  double A, B, C;
  Line(double A, double B, double C) : A(A), B(B), C(C) {}
  Line() {}
  Line(Point p, Point q);
  Line(Point p, double degree);
};
double determinant(double x1, double x2, double y1, double y2) {
  return x1 * y2 - x2 * y1;
}
void equationSolution(double &x, double &y, double a1, double b1, double c1,
                      double a2, double b2, double c2) {
  double W, Wx, Wy;
  W = determinant(a1, b1, a2, b2);
  Wx = determinant(c1, b1, c2, b2);
  Wy = determinant(a1, c1, a2, c2);
  x = Wx / W;
  y = Wy / W;
}
Line::Line(Point p, Point q) {
  if (compare(p.x, q.x)) {
    A = 1.0;
    B = 0.0;
    C = -p.x;
  } else {
    B = 1.0;
    equationSolution(A, C, p.x, 1.0, -p.y, q.x, 1.0, -q.y);
  }
}
Line::Line(Point p, double degree) {
  if (compare(degree, 0.0) || compare(degree, 180.0)) {
    A = 1.0;
    B = 0.0;
    C = -p.x;
  } else {
    B = 1;
    if (degree > 180.0) degree -= 180.0;
    A = tan(degree * M_PI / 180.0);
    C = p.y - p.x * A;
  }
}
void parallelLinesAtDistance(Line &result1, Line &result2, Line l, double d) {
  Point p(0.0, -l.C / l.B);
  result1.A = result2.A = l.A;
  result1.B = result2.B = l.B;
  d *= sqrt(l.A * l.A + l.B * l.B);
  result1.C = d - l.A * p.x - l.B * p.y;
  result2.C = -d - l.A * p.x - l.B * p.y;
}
struct LineSegment {
  Point p1, p2;
  Line l;
  LineSegment(Point p1, Point p2, Line l) : p1(p1), p2(p2), l(l) {}
  LineSegment(Point p1, Point p2) : p1(p1), p2(p2) { l = Line(p1, p2); }
  LineSegment() {}
};
Point lineIntersection(Line l, Line k) {
  double x, y;
  equationSolution(x, y, l.A, l.B, -l.C, k.A, k.B, -k.C);
  return Point(x, y);
}
bool isPointInSegment(Point p, LineSegment w) {
  double Xmax = max(w.p1.x, w.p2.x), Xmin = min(w.p1.x, w.p2.x),
         Ymax = max(w.p1.y, w.p2.y), Ymin = min(w.p1.y, w.p2.y);
  if (compare(w.l.A * p.x + w.l.B * p.y + w.l.C, 0.0) &&
      (p.x < Xmax || compare(p.x, Xmax)) &&
      (p.x > Xmin || compare(p.x, Xmin)) &&
      (p.y < Ymax || compare(p.y, Ymax)) && (p.y > Ymin || compare(p.y, Ymin)))
    return 1;
  return 0;
}
struct Vector {
  double a, b;
  Vector(double a, double b) : a(a), b(b) {}
  Vector() {}
  Vector(Point b, Point e);
};
Vector::Vector(Point b, Point e) {
  a = e.x - b.x;
  this->b = e.y - b.y;
}
double vectorMultiplied(Vector v, Vector u) {
  return determinant(v.a, v.b, u.a, u.b);
}
double triangleArea(Point q, Point p, Point r) {
  return vectorMultiplied(Vector(q, p), Vector(q, r)) / 2;
}
double polygonArea(vector<Point> &tab) {
  double result = 0.0;
  int T = tab.size();
  for (int i = 2; i < T; ++i) {
    result += triangleArea(tab[0], tab[i - 1], tab[i]);
  }
  return result;
}
int main() {
  double w, h, a;
  scanf("%lf%lf%lf", &w, &h, &a);
  if (compare(a, 90)) {
    double q = min(w, h);
    printf("%lf\n", q * q);
    return 0;
  }
  LineSegment rec[4];
  rec[0] = LineSegment(Point(-w / 2, h / 2), Point(w / 2, h / 2)),
  rec[1] = LineSegment(Point(-w / 2, h / 2), Point(-w / 2, -h / 2)),
  rec[2] = LineSegment(Point(-w / 2, -h / 2), Point(w / 2, -h / 2)),
  rec[3] = LineSegment(Point(w / 2, h / 2), Point(w / 2, -h / 2));
  Line l1(Point(0.0, 0.0), a), l2(Point(0.0, 0.0), a + 90.0);
  Line rot[4];
  parallelLinesAtDistance(rot[0], rot[1], l1, h / 2);
  parallelLinesAtDistance(rot[2], rot[3], l2, w / 2);
  vector<Point> tab[4];
  Point p;
  for (int i = 0; i < 4; ++i) {
    for (int j = 0; j < 4; ++j) {
      p = lineIntersection(rec[i].l, rot[j]);
      if (isPointInSegment(p, rec[i])) {
        tab[i].push_back(p);
      }
    }
  }
  vector<Point> pol;
  if (tab[0].size() == 2 && tab[0][0].x < tab[0][1].x &&
      !compare(tab[0][0].x, tab[0][1].x)) {
    swap(tab[0][1], tab[0][0]);
  }
  if (tab[1].size() == 2 && tab[1][0].y < tab[1][1].y &&
      !compare(tab[1][0].y, tab[1][1].y)) {
    swap(tab[1][1], tab[1][0]);
  }
  if (tab[2].size() == 2 && tab[2][0].x > tab[2][1].x &&
      !compare(tab[2][0].x, tab[2][1].x)) {
    swap(tab[2][1], tab[2][0]);
  }
  if (tab[3].size() == 2 && tab[3][0].y > tab[3][1].y &&
      !compare(tab[3][0].y, tab[3][1].y)) {
    swap(tab[3][1], tab[3][0]);
  }
  for (int i = 0; i < 4; ++i)
    for (int j = 0; j < tab[i].size(); ++j) {
      if (pol.empty() || !(compare(tab[i][j].x, pol.back().x) &&
                           compare(tab[i][j].y, pol.back().y)))
        pol.push_back(tab[i][j]);
    }
  printf("%lf\n", polygonArea(pol));
  return 0;
}