**Compilation/Execution Result:**

Given N points on a 2D plane, Your task is to complete the function **maxPoints** which returns an integer denoting the maximum number of points which lie on the same straight line.

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow . Each test case contains an integer N denoting the total no of points. And then in the next line are the N space separated values X[i] denoting the X coordinates of the ith point and then in the next line are N space separated values Y[i] denoting the Y coordinates of the ith point.

**Output:**

For each test case in a new line output will be the count of maximum number of points that lie on the same straight line.

**Constraints:**

1<=T<=100

1<=N<=50

**Example(To be used only for expected output):
Input:**

2

2

1 1

2 2

3

0 0 0

4 5 6

2

3

Cqwert | 56 |

rksingh | 54 |

Lam Ngoc Pham | 53 |

lucifer012 | 53 |

BharghviPrajapati | 52 |

Shashank_Pathak | 628 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 357 |

Infinty | 344 |

akhayrutdinov | 4156 |

sanjay05 | 3611 |

Quandray | 2815 |

Ibrahim Nash | 2489 |

Michael Riegger | 2290 |