//Tom和Jack在玩一个数字游戏，对方随机报出一个四位正整数，

//要求另外一方在1分钟内报出该数所对应的二进制数中最大的连续为1的位数数量。

//例如，Jack报出一个数29(11101)，Tom应在1分钟之内报出3与之对应，

//但Tom的数学较差，总是不能按时报出结果。你是Tom的好朋友，而且精通编程，

//现在，Tom想请你为他写一段小程序来解决此问题。要求：输入一个正整数n(int类型)，

//输出该数所对应的二进制数中最大的连续为1的位数数量-//Tom and Jack are playing a numbers game, the other side were four reported a positive integer,// request the other party within 1 minute to give the binary number corresponding to the largest number of consecutive digits of the number of 1.// For example, Jack reported that a number of 29 (11101), Tom should be reported within 1 minute of the corresponding 3,// but the mathematical poor Tom, can not always be the result of the Times. Are you a good friend of Tom, and proficient in programming,// now, Tom would like to ask you for him to write a small program to solve this problem. Requirements: Enter a positive integer n (int type),// output the binary number corresponding to the largest number of consecutive 1-digit number for