#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define fs first
#define sc second

const LL MOD = 1e9+7;
const double EPS = 1e-10;

template<class T>bool chmax(T &a, const T &b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>bool chmin(T &a, const T &b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a,make_vector<T>(b,ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) {
        is >> e;
    }
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    operator int() const { return to; }

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

template<typename T>
using Edges = vector<edge<T>>;
template<typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template<typename T>
using MatrixGraph = vector<vector<T>>;

typedef complex<double> Point;
typedef pair<Point, Point> LS;

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

double dot(const Point &a, const Point &b) {
    return a.real() * b.real() + a.imag() * b.imag();
}


int is_intersected_ls(
        const Point &a1, const Point &a2,
        const Point &b1, const Point &b2)
{
    return cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < EPS &&
        cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1) < EPS;
}

int is_intersected_ls(const LS &l1, const LS &l2) {
    return is_intersected_ls(l1.first, l1.second, l2.first, l2.second);
}

int is_parallel(
        const Point &a1, const Point &a2,
        const Point &b1, const Point &b2)
{
    return abs(cross(a1-a2, b1-b2)) < EPS;
}

double distance_l_p(const LS &ls, const Point &c) {
    Point a = ls.fs, b = ls.sc;
    if (dot(b-a, c-a) < EPS) return abs(c-a);
    if (dot(a-b, c-b) < EPS) return abs(c-b);
    return abs(cross(b-a, c-a)) / abs(b-a);
}

double ls_distance(const LS &a, const LS &b) {
    bool parallel = is_parallel(a.fs, a.sc, b.fs, b.sc);
    bool intersect = is_intersected_ls(a.fs, a.sc, b.fs, b.sc);

    if (!parallel && intersect) return 0;

    return min({distance_l_p(a, b.fs),
            distance_l_p(a, b.sc),
            distance_l_p(b, a.fs),
            distance_l_p(b, a.sc)});
}

Point cross_p(const Point& a1, const Point& a2,
              const Point& b1, const Point& b2) {
    double s1 = abs(cross(b1-a1, b2-a1)),
           s2 = abs(cross(b1-a2, b2-a2));
    return (a1 * s2 + a2 * s1) / (s1 + s2);
}

Point cross_p(const LS &l1, const LS &l2) {
    return cross_p(l1.first, l1.second, l2.first, l2.second);
}

struct UnionFind
{
    vector<int> par, sz;
    UnionFind(int n) {
        par.resize(n);
        sz.resize(n, 1);
        for (int i = 0; i < n; ++i) par[i] = i;
    }
    int root(int x) {
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
    bool merge(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (sz[x] < sz[y]) swap(x, y);
        par[y] = x;
        sz[x] += sz[y];
        sz[y] = 0;
        return true;
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    int size(int x) {
        return sz[root(x)];
    }
};

int main()
{
    while (true) {
        int n; cin >> n;
        if (n == 0) {
            break;
        }

        vector<LS> ls;
        int ans = 1;
        for (int k = 0; k < n; ++k) {
            double x1, y1, x2, y2;
            cin >> x1 >> y1 >> x2 >> y2;

            Point p1{x1,y1}, p2{x2,y2};
            LS line{p1, p2};

            vector<Point> cross_point;
            cross_point.push_back(p1);
            cross_point.push_back(p2);
            for (auto l : ls) {
                if (!is_intersected_ls(line, l)) continue;
                cross_point.push_back(cross_p(line, l));
            }

            int m = cross_point.size();
            UnionFind uf(m);
            for (int i = 0; i < m; ++i) {
                for (int j = i+1; j < m; ++j) {
                    if (abs(cross_point[i] - cross_point[j]) < EPS) {
                        uf.merge(i, j);
                    }
                }
            }

            map<int,bool> root;
            for (int i = 0; i < m; ++i) {
                root[uf.root(i)] = true;
            }

            ans += root.size() - 1;

            ls.push_back(line);
        }
        cout << ans << endl;
    }

    return 0;
}



Measured memory_bytes: 3232