{"trustable":false,"sections":[{"title":"Description","value":{"format":"HTML","content":"During the power crisis in New Zealand this winter (caused by a shortage of rain and hence low levels\nin the hydro dams), a contingency scheme was developed to turn off the power to areas of the country\nin a systematic, totally fair, manner. The country was divided up into N regions (Auckland was region\nnumber 1, and Wellington number 13). A number, m, would be picked ‘at random’, and the power would\nfirst be turned off in region 1 (clearly the fairest starting point) and then in every m’th region after that,\nwrapping around to 1 after N, and ignoring regions already turned off. For example, if N \u003d 17 and\nm \u003d 5, power would be turned off to the regions in the order:1,6,11,16,5,12,2,9,17,10,4,15,14,3,8,13,7.\nThe problem is that it is clearly fairest to turn off Wellington last (after all, that is where the\nElectricity headquarters are), so for a given N, the ‘random’ number m needs to be carefully chosen so\nthat region 13 is the last region selected.\nWrite a program that will read in the number of regions and then determine the smallest number m\nthat will ensure that Wellington (region 13) can function while the rest of the country is blacked out."}},{"title":"Input","value":{"format":"HTML","content":"Input will consist of a series of lines, each line containing the number of regions (N) with 13 ≤ N \u003c 100.\nThe file will be terminated by a line consisting of a single ‘0’."}},{"title":"Output","value":{"format":"HTML","content":"Output will consist of a series of lines, one for each line of the input. Each line will consist of the\nnumber m according to the above scheme."}},{"title":"Sample Input","value":{"format":"HTML","content":"17\n0"}},{"title":"Sample Output","value":{"format":"HTML","content":"7"}}]}