n = int(raw_input()) n1 = 2*n h = [[]*4]*n1 for x in range(n1):     h[x] = map(int,raw_input().split())      for i in range(0,n1,2):     b = []     for j in range(4):         for k in range(j+1,4):             longs = h[i][j]-h[i][k]             longs1 = h[i+1][j]-h[i+1][j]             sums = longs*longs + longs1*longs1             if sums in b:                 break             else:                 b.append(sums)     if len(b) == 2:         print 'Yes'     else:         print 'No' 第一题，不知道怎么样，最后没粘上去，自己试是可以