#include <stdio.h>
 
// 相互再帰関数(偶数判定)
int isEven(int n);
int isOdd(int n) {
    if (n ==0) {
        return 0; // return falseと同じ
    } else {
        return isEven(n-1); // 奇数なら、1つ小さい数は偶数
    }
}
 
// 相互再帰関数(奇数判定)
int isEven(int n) {
    if (n ==0) {
        return 1; // return trueと同じ
    } else {
        return isOdd(n-1); // 偶数なら、1つ小さい数は奇数
    }
}
 
int main() {
    int num;
 
    if (isEven(num)) {
    } else {
    }
    return 0;
}
				I2luY2x1ZGUgPHN0ZGlvLmg+CgovLyDnm7jkupLlho3luLDplqLmlbDvvIjlgbbmlbDliKTlrprvvIkKaW50IGlzRXZlbihpbnQgbik7CmludCBpc09kZChpbnQgbikgewogICAgaWYgKG4gPT0wKSB7CiAgICAgICAgcmV0dXJuIDA7IC8vIHJldHVybiBmYWxzZeOBqOWQjOOBmAogICAgfSBlbHNlIHsKICAgICAgICByZXR1cm4gaXNFdmVuKG4tMSk7IC8vIOWlh+aVsOOBquOCieOAgTHjgaTlsI/jgZXjgYTmlbDjga/lgbbmlbAKICAgIH0KfQoKLy8g55u45LqS5YaN5biw6Zai5pWw77yI5aWH5pWw5Yik5a6a77yJCmludCBpc0V2ZW4oaW50IG4pIHsKICAgIGlmIChuID09MCkgewogICAgICAgIHJldHVybiAxOyAvLyByZXR1cm4gdHJ1ZeOBqOWQjOOBmAogICAgfSBlbHNlIHsKICAgICAgICByZXR1cm4gaXNPZGQobi0xKTsgLy8g5YG25pWw44Gq44KJ44CBMeOBpOWwj+OBleOBhOaVsOOBr+Wlh+aVsAogICAgfQp9CgppbnQgbWFpbigpIHsKICAgIGludCBudW07CiAgICBwcmludGYoIuaVtOaVsOOCkuWFpeWKm+OBl+OBpuOBj+OBoOOBleOBhO+8miIpOwogICAgc2NhbmYoIiVkIiwgJm51bSk7CgogICAgaWYgKGlzRXZlbihudW0pKSB7CiAgICAgICAgcHJpbnRmKCIlZCDjga/lgbbmlbDjgafjgZnjgIJcbiIsbnVtKTsKICAgIH0gZWxzZSB7CiAgICAgICAgcHJpbnRmKCIlZCDjga/lpYfmlbDjgafjgZnjgIJcbiIsIG51bSk7CiAgICB9CiAgICByZXR1cm4gMDsKfQ==