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 = 1e-9;
struct pt {
  double x, y;
};
ostream& operator<<(ostream& out, const pt& p) {
  out << p.x << ' ' << p.y;
  return out;
}
inline bool between(double l, double r, double x) {
  return min(l, r) <= x + eps && x <= max(l, r) + eps;
}
inline double det(double a0, double a1, double b0, double b1) {
  return a0 * b1 - a1 * b0;
}
struct line {
  double a, b, c;
  line(pt a0, pt a1) {
    a = a1.y - a0.y;
    b = a0.x - a1.x;
    c = -a0.x * a - a0.y * b;
  }
  bool intersect(const line& l, pt& res) {
    double d = det(a, b, l.a, l.b);
    if (fabs(d) <= eps) return false;
    res.x = -det(c, b, l.c, l.b) / d;
    res.y = -det(a, c, l.a, l.c) / d;
    return true;
  }
};
bool segment_intersection(pt a0, pt a1, pt b0, pt b1, pt& res) {
  line l1(a0, a1);
  line l2(b0, b1);
  if (!l1.intersect(l2, res)) return false;
  return between(a0.x, a1.x, res.x) && between(b0.x, b1.x, res.x) &&
         between(a0.y, a1.y, res.y) && between(b0.y, b1.y, res.y);
}
void rotate(const pt& p, pt& res, double angle) {
  double rm[][2] = {{cos(angle), -sin(angle)}, {sin(angle), cos(angle)}};
  res.x = rm[0][0] * p.x + rm[0][1] * p.y;
  res.y = rm[1][0] * p.x + rm[1][1] * p.y;
}
bool cmp(pt a, pt b) {
  double angle1 = atan2(a.y, a.x);
  if (angle1 <= .0) angle1 += M_PI * 2;
  double angle2 = atan2(b.y, b.x);
  if (angle2 <= .0) angle2 += M_PI * 2;
  return angle1 <= angle2;
}
int main() {
  double w, h, angle;
  cin >> w >> h >> angle;
  pt points1[] = {
      {w / 2, -h / 2}, {w / 2, h / 2}, {-w / 2, h / 2}, {-w / 2, -h / 2}};
  pt points2[4];
  pt res;
  for (int i = 0; i < 4; ++i)
    rotate(points1[i], points2[i], angle * M_PI / 180);
  vector<pt> v;
  for (int i = 0; i < 4; ++i)
    for (int j = 0; j < 4; ++j)
      if (segment_intersection(points1[i], points1[(i + 1) & 3], points2[j],
                               points2[(j + 1) & 3], res)) {
        v.push_back(res);
      }
  sort(v.begin(), v.end(), cmp);
  double s = 0;
  for (int i = 0, n = v.size(); i < n; ++i)
    s += (v[(i + 1) % n].x - v[i].x) * (v[(i + 1) % n].y + v[i].y);
  printf("%.7lf\n", fabs(s) / 2);
  return 0;
}