Given a number N, find the maximum number of unique prime factors any number can have in range [1, N].

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a number N as input.

**Output:**

For each test case, print the maximum number of unique prime factors of a number.

**Constraints:**

1<=T<=200

1<=N<=10^{18}

**Example:**

**Input:**

2

3

500

**Output:**

1

4

Author: arun03

:p | 491 |

Anshul Wadhawan | 414 |

Shivam_Kumar_Singh | 316 |

facelessman_x | 312 |

Calahan | 295 |

Anshul Wadhawan | 874 |

rambo | 868 |

Calahan | 816 |

Suraj Kumar 14 | 792 |

fullmetal27 | 758 |

akhayrutdinov | 4698 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3543 |

surbhi_7 | 2748 |