#include <bits/stdc++.h>
using namespace std;
struct Point {
  double x, y;
  Point() {}
  Point(double a, double b) { x = a, y = b; }
};
const double eps = 1e-10;
Point operator+(Point A, Point B) { return Point(A.x + B.x, A.y + B.y); }
Point operator-(Point A, Point B) { return Point(A.x - B.x, A.y - B.y); }
Point operator*(Point A, double p) { return Point(A.x * p, A.y * p); }
Point operator/(Point A, double p) { return Point(A.x / p, A.y / p); }
bool operator<(const Point &a, const Point &b) {
  return a.x < b.x || (a.x == b.x && a.y < b.y);
}
int dcmp(double x) {
  if (fabs(x) < eps)
    return 0;
  else
    return x < 0 ? -1 : 1;
}
bool operator==(const Point &a, const Point &b) {
  return dcmp(a.x - b.x) == 0 && dcmp(a.y - b.y) == 0;
}
double Dot(Point A, Point B) { return A.x * B.x + A.y * B.y; }
double Length(Point A) { return sqrt(Dot(A, A)); }
double Angle(Point A, Point B) {
  return acos(Dot(A, B) / Length(A) / Length(B));
}
double Cross(Point A, Point B) { return A.x * B.y - A.y * B.x; }
double Area2(Point A, Point B, Point C) { return Cross(B - A, C - A); }
Point Rotate(Point A, double rad) {
  return Point(A.x * cos(rad) - A.y * sin(rad),
               A.x * sin(rad) + A.y * cos(rad));
}
Point Jd(Point P, Point v, Point Q, Point w) {
  Point u = P - Q;
  double t = Cross(w, u) / Cross(v, w);
  return P + v * t;
}
double Dtl(Point P, Point A, Point B) {
  Point v1 = B - A, v2 = P - A;
  return fabs(Cross(v1, v2)) / Length(v1);
}
double Dts(Point P, Point A, Point B) {
  if (A == B) return Length(P - A);
  Point v1 = B - A, v2 = P - A, v3 = P - B;
  if (dcmp(Dot(v1, v2) < 0))
    return Length(v2);
  else if (dcmp(Dot(v1, v3)) > 0)
    return Length(v3);
  else
    return fabs(Cross(v1, v2)) / Length(v1);
}
Point Gjp(Point P, Point A, Point B) {
  Point v = B - A;
  return A + v * (Dot(v, P - A)) / (Dot(v, v));
}
bool Spi(Point a1, Point a2, Point b1, Point b2) {
  double c1 = Cross(a2 - a1, b1 - a1), c2 = Cross(a2 - a1, b2 - a1),
         c3 = Cross(b2 - b1, a1 - b1), c4 = Cross(b2 - b1, a2 - a1);
  return dcmp(c1) * dcmp(c2) < 0 && dcmp(c3) * dcmp(c4) < 0;
}
bool Onseg(Point p, Point a1, Point a2) {
  return dcmp(Cross(a1 - p, a2 - p)) == 0 && dcmp(Dot(a1 - p, a2 - p)) < 0;
}
double Parea(Point *p, int n) {
  double area = 0;
  for (int i = 1; i <= n; i++) area += Cross(p[i] - p[0], p[i + 1] - p[0]);
  return area / 2;
}
bool cmp(Point a, Point b) {
  if (fabs(a.x - b.x) > eps)
    return a.x + eps < b.x;
  else
    return a.y + eps < b.y;
}
struct Circle {
  Point o;
  double r;
  Circle() {}
  Circle(Point _o, double _r) { o = _o, r = _r; }
  friend vector<Point> operator&(const Circle &c1, const Circle &c2) {
    double d = Length(c1.o - c2.o);
    if (d > c1.r + c2.r + eps || d < fabs(c1.r - c2.r) - eps)
      return vector<Point>();
    double dt = (c1.r * c1.r - c2.r * c2.r) / d, d1 = (d + dt) / 2.0;
    Point dir = (c2.o - c1.o) / d, pcrs = c1.o + dir * d1;
    dt = sqrt(max(0.0, c1.r * c1.r - d1 * d1));
    swap(dir.x, dir.y), dir.x = -dir.x;
    return vector<Point>{pcrs + dir * dt, pcrs - dir * dt};
  }
} p[10];
int f[10], rk[10], n;
int find(int x) {
  if (f[x] != x)
    return f[x] = find(f[x]);
  else
    return x;
}
void merge(int i, int j) {
  int x = find(i), y = find(j);
  if (rk[x] > rk[y])
    f[y] = x;
  else {
    f[x] = y;
    if (rk[x] == rk[y]) rk[y]++;
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) f[i] = i, rk[i] = 0;
  for (int i = 1; i <= n; i++) cin >> p[i].o.x >> p[i].o.y >> p[i].r;
  int e = 0, v = 0, c = 0;
  vector<Point> all;
  for (int i = 1; i <= n; i++) {
    vector<Point> tmp1;
    for (int j = 1; j <= n; j++) {
      if (j == i) continue;
      vector<Point> tmp2 = p[i] & p[j];
      if (tmp2.size()) merge(i, j);
      tmp1.insert(tmp1.end(), tmp2.begin(), tmp2.end());
      all.insert(all.end(), tmp2.begin(), tmp2.end());
    }
    sort(tmp1.begin(), tmp1.end(), cmp);
    e += unique(tmp1.begin(), tmp1.end()) - tmp1.begin();
  }
  sort(all.begin(), all.end(), cmp);
  v += unique(all.begin(), all.end()) - all.begin();
  set<int> st;
  for (int i = 1; i <= n; i++) {
    st.insert(find(i));
  }
  cout << e - v + st.size() + 1 << endl;
}
