DOL - Largest Odd Divisor

no tags 

Given a non-negative integers N. You have to find the largest odd divisor of N.


Input starts with an integer T (1<=T<=5000) denoting the number of test cases. Each test case contains an integer N (1<=N<=1012).


For each test case print the case number and the largest odd divisor of N.

Sample Input

Output for Sample Input


Case 1: 1
Case 2: 5

Problem Setter: Md Abdul Alim, CEO and Founder at CodeMask

hide comments
aj_254: 2019-04-13 23:01:58

very easy ..

prabhav_123: 2019-01-06 23:43:37

never code with your headphones on, I repeat never. Costed me 2 WA's.

n_o_o_b_i_e: 2018-06-13 17:31:41

forgot to write "case " costed WA

terminator222: 2017-06-18 09:29:31

Why is it DOL not LOd :P?

Last edit: 2017-06-18 09:29:46
ayushgupta1997: 2017-05-30 19:36:15

easy :p nothing to cheer!

tomas32: 2017-04-20 17:36:16

care about the output, cost me 10 wa

kira28: 2016-12-31 19:05:43


sandeep_4141: 2016-10-29 10:58:17

lollypop!!very about output format!!

coder_hsnake: 2016-08-30 21:11:48

if input is 9 print 9 this may help :-) ac in one go

ayushraj: 2016-08-08 23:12:41

Very Easy Problem! :D

Last edit: 2016-08-08 23:15:21

Added by:Md Abdul Alim
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 GOSU JS-MONKEY
Resource:Own Problem