Given a positive integer N, Your task is to complete the function **countValues** which returns an integer denoting the count of all positive integers i such that

0 <= i <= n and n+i = n^i where ^ denotes a XOR operation.

**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.

**Output:**

For each test case in a new line output will be the count of such positive integers.

**Constraints:**

1<=T<=100

1<=N<=1000

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

2

7

12

1

4

7^i = 7+i holds only for only for i = 0

7+0 = 7^0 = 7

12^i = 12+i hold only for i = 0, 1, 2, 3

for i=0, 12+0 = 12^0 = 10

for i=1, 12+1 = 12^1 = 13

for i=2, 12+2 = 12^2 = 14

for i=3, 12+3 = 12^3 = 15

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

bhatabhi554 | 317 |

hardikJain5 | 306 |

CodeBuddy | 293 |

Akkki111 | 233 |

clone | 230 |

KshatriyaYash | 1932 |

nikhil_sojan | 1374 |

lonecoder | 1236 |

mazumderrohit8 | 1176 |

RemoveTLE | 1144 |

blackshadows | 5327 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4605 |

Quandray | 4444 |

Login to report an issue on this page.