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 PI = acos(0.0) * 2.0;
struct Point {
  double x, y;
  Point(double x_1, double y_1) {
    x = x_1;
    y = y_1;
  }
  Point() {}
  Point operator-(const Point a) const { return Point(x - a.x, y - a.y); }
  Point operator+(const Point a) const { return Point(x + a.x, y + a.y); }
  Point operator/(double a) const { return Point(x / a, y / a); }
  Point operator*(double a) const { return Point(x * a, y * a); }
  double getDir() const {
    double ang;
    if (abs(x) <= (1e-9))
      ang = PI / 2.0;
    else
      ang = atan(abs(y) / abs(x));
    if (x >= 0 and y >= 0) return ang;
    if (x >= 0) return -ang;
    if (y > 0) return PI - ang;
    return PI + ang;
  }
  Point rotate(double ang) {
    double ang_this = getDir();
    double d = hypot(y, x);
    return Point(d * cos(ang_this + ang), d * sin(ang_this + ang));
  }
  double dist(const Point p) const { return hypot(p.x - x, p.y - y); }
  Point normalice() {
    double d = hypot(x, y);
    return Point(x / d, y / d);
  }
};
struct Linea {
  Point a, b;
  double alfa;
  double c;
  double m;
  Point ab;
  Linea() {}
  Linea(Point _a, Point _b, bool f) {
    a = _a;
    if (f) {
      b = _b;
      ab = b - a;
    } else {
      ab = _b;
    }
    alfa = ab.getDir();
    if (abs(ab.x) <= (1e-9)) {
      m = (1e30);
      c = a.x;
    } else {
      m = tan(alfa);
      c = a.y - m * a.x;
    }
  }
  Point getIntersection(const Linea R) const {
    Point P;
    if (abs(ab.x) <= (1e-9)) {
      P.x = a.x;
      P.y = R.m * P.x + R.c;
    } else {
      if (abs(R.ab.x) <= (1e-9)) {
        P.x = R.a.x;
        P.y = m * P.x + c;
      } else {
        P.x = (R.c - c) / (m - R.m);
        P.y = m * P.x + c;
      }
    }
    return P;
  }
  bool getIntersectionSegmento(const Linea R, Point& P) const {
    if (abs(ab.x) <= (1e-9)) {
      P.x = a.x;
      P.y = R.m * P.x + R.c;
    } else {
      if (abs(R.ab.x) <= (1e-9)) {
        P.x = R.a.x;
        P.y = m * P.x + c;
      } else {
        P.x = (R.c - c) / (m - R.m);
        P.y = m * P.x + c;
      }
    }
    return (a.dist(P) + b.dist(P) <= a.dist(b) + (1e-9)) and
           (R.a.dist(P) + R.b.dist(P) <= R.a.dist(R.b) + (1e-9));
  }
};
bool operator<(const Point& a, const Point& b) {
  return a.getDir() < b.getDir();
}
double getArea(vector<Point> P);
int main() {
  double alfa;
  double w, h;
  cin >> w >> h >> alfa;
  w /= 2.0;
  h /= 2.0;
  alfa = PI * alfa / 180.0;
  vector<Point> Normal, Rotado;
  Normal.push_back(Point(w, -h));
  Normal.push_back(Point(w, h));
  Normal.push_back(Point(-w, h));
  Normal.push_back(Point(-w, -h));
  Normal.push_back(Point(w, -h));
  for (int i = 0; i < 5; i++) {
    Rotado.push_back(Normal[i].rotate(alfa));
  }
  vector<Point> inter;
  for (int i = 0; i < 4; i++) {
    Linea L_normal = Linea(Normal[i], Normal[i + 1], true);
    for (int m = 0; m < 4; m++) {
      Linea L_rotada = Linea(Rotado[m], Rotado[m + 1], true);
      Point intersec;
      bool ok = L_normal.getIntersectionSegmento(L_rotada, intersec);
      if (ok) {
        inter.push_back(intersec);
      }
    }
  }
  sort(inter.begin(), inter.end());
  inter.push_back(inter.front());
  double ansArea = getArea(inter);
  printf("%.9lf\n", ansArea);
  return 0;
}
double getArea(vector<Point> P) {
  double ans = 0;
  for (int i = 1; i < P.size(); i++) {
    ans += P[i - 1].x * P[i].y - P[i].x * P[i - 1].y;
  }
  return ans / 2.0;
}