/**
 *  Area Separation (Problem D, Practice Contest for Japan Domestic, 2005-06-19)
 *  by Kenji Inoue, 2007-01-07
 **/

#include <iostream>
#include <complex>
#include <vector>

using namespace std;

typedef complex<double> P;
#define EPS (1e-10)
#define EQ(a,b) (abs((a)-(b)) < EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )

P s[100], e[100];

double cross(P a, P b) {
  return (a.real() * b.imag() - a.imag() * b.real());
}

int main() {
  int n;
  while (cin >> n, n) {
    for (int i=0; i<n; i++) {
      cin >> s[i].real() >> s[i].imag();
      cin >> e[i].real() >> e[i].imag();
    }

    int ans = 1;
    for (int i=0; i<n; i++) {
      vector<P> isp; // intersection points found
      int cnt = 0;
      for (int j=0; j<i; j++) {
        P iv = e[i] - s[i];
        P jv = e[j] - s[j];
        // check if parallel
        if (abs(cross(iv, jv)) < EPS) { continue; }

        // calculate the intersection point
        P p = s[i] + iv * cross(jv, s[j]-s[i]) / cross(jv, iv);
        if (abs(p.real()) > 100.0 - EPS) { continue; }
        if (abs(p.imag()) > 100.0 - EPS) { continue; }

        bool duplicate = false;
        for (int k=0; k<isp.size(); k++) {
          if (EQV(p, isp[k])) {
            duplicate = true;
            break;
          }
        }
        if (!duplicate) {
          cnt++;
          isp.push_back(p);
        }
      }
      ans += cnt + 1;
    }

    cout << ans << endl;
  }

  return 0;
}