{"trustable":false,"sections":[{"title":"题目描述: ","value":{"format":"MD","content":"给定一个正整数N, 找出**至少两个**正整数, 使得它们的最小公倍数为N, 并且这些正整数的和最小, 输出最小的和. \n\n\n\n\n"}},{"title":"输入格式: ","value":{"format":"MD","content":"输入为若干行, 每行为一个测试实例, 包含一个正整数N, 当N\u003d0时表示输入中止. 输入至多有100个测试实例. "}},{"title":"输出格式: ","value":{"format":"MD","content":"每行以\u0027Case #: \u0027开头, 其中#代表当前的测试实例编号(从1开始), 然后是一个正整数, 表示答案. "}},{"title":"输入样例: ","value":{"format":"MD","content":"```\n12\n10\n5\n0\n```"}},{"title":"输出样例: ","value":{"format":"MD","content":"```\nCase 1: 7\nCase 2: 7\nCase 3: 6\n\n```"}},{"title":"提示: ","value":{"format":"MD","content":"\n对于所有测试实例, 1 \u003c\u003d N \u003c 2^31(2的31次方). \n\n注意输出最后的空行. "}}]}