#include <cstdio>
#include <algorithm>
#include <map>
 
using namespace std;
 
int main(){
    int N,x[200],y[200];
 
    while(true){
        scanf("%d",&N);
        if(N==0) break;
 
        for(int i = 0;i<N;++i)
            scanf("%d %d",&x[i],&y[i]);
 
        map< pair<int, int> , int > M;
 
        for(int i = 0;i<N;++i){
            for(int j = i+1;j<N;++j){
                int dx = x[i]-x[j],dy = y[i]-y[j];
                int g = __gcd(dx,dy);
 
                dx /= g; dy /= g;
 
                if(dx<0){
                    dx = -dx;
                    dy = -dy;
                }
 
                M[make_pair(dx,dy)]++;
            }
        }
 
        printf("%d\n",(int)M.size());
    }
 
    return 0;
}

I2luY2x1ZGUgPGNzdGRpbz4KI2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPG1hcD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpewogICAgaW50IE4seFsyMDBdLHlbMjAwXTsKICAgIAogICAgd2hpbGUodHJ1ZSl7CiAgICAgICAgc2NhbmYoIiVkIiwmTik7CiAgICAgICAgaWYoTj09MCkgYnJlYWs7CiAgICAgICAgCiAgICAgICAgZm9yKGludCBpID0gMDtpPE47KytpKQogICAgICAgICAgICBzY2FuZigiJWQgJWQiLCZ4W2ldLCZ5W2ldKTsKICAgICAgICAKICAgICAgICBtYXA8IHBhaXI8aW50LCBpbnQ+ICwgaW50ID4gTTsKICAgICAgICAKICAgICAgICBmb3IoaW50IGkgPSAwO2k8TjsrK2kpewogICAgICAgICAgICBmb3IoaW50IGogPSBpKzE7ajxOOysrail7CiAgICAgICAgICAgICAgICBpbnQgZHggPSB4W2ldLXhbal0sZHkgPSB5W2ldLXlbal07CiAgICAgICAgICAgICAgICBpbnQgZyA9IF9fZ2NkKGR4LGR5KTsKICAgICAgICAgICAgICAgIAogICAgICAgICAgICAgICAgZHggLz0gZzsgZHkgLz0gZzsKICAgICAgICAgICAgICAgIAogICAgICAgICAgICAgICAgaWYoZHg8MCl7CiAgICAgICAgICAgICAgICAgICAgZHggPSAtZHg7CiAgICAgICAgICAgICAgICAgICAgZHkgPSAtZHk7CiAgICAgICAgICAgICAgICB9CiAgICAgICAgICAgICAgICAKICAgICAgICAgICAgICAgIE1bbWFrZV9wYWlyKGR4LGR5KV0rKzsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICAKICAgICAgICBwcmludGYoIiVkXG4iLChpbnQpTS5zaXplKCkpOwogICAgfQogICAgCiAgICByZXR1cm4gMDsKfQ==

NAotMSAxCi0yIDAKMCAwCjEgMQow

4
-1 1
-2 0
0 0
1 1
0