#define NULL ((void *)0)
typedef unsigned long size_t; // Customize by platform.
typedef long intptr_t;
typedef unsigned long uintptr_t;
typedef long scalar_t__; // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */

/* Type definitions */

/* Variables and functions */
int /*<<< orphan*/ assert(int);
int find_num_possible_binary_search_trees_size_n_v1(int);
int find_num_possible_binary_search_trees_size_n_v2(int);
int main() {
  assert(0 == find_num_possible_binary_search_trees_size_n_v1(-10));
  assert(0 == find_num_possible_binary_search_trees_size_n_v2(-10));
  assert(0 == find_num_possible_binary_search_trees_size_n_v1(0));
  assert(0 == find_num_possible_binary_search_trees_size_n_v2(0));
  assert(1 == find_num_possible_binary_search_trees_size_n_v1(1));
  assert(1 == find_num_possible_binary_search_trees_size_n_v2(1));
  assert(2 == find_num_possible_binary_search_trees_size_n_v1(2));
  assert(2 == find_num_possible_binary_search_trees_size_n_v2(2));
  assert(5 == find_num_possible_binary_search_trees_size_n_v1(3));
  assert(5 == find_num_possible_binary_search_trees_size_n_v2(3));
  assert(14 == find_num_possible_binary_search_trees_size_n_v1(4));
  assert(14 == find_num_possible_binary_search_trees_size_n_v2(4));
  assert(42 == find_num_possible_binary_search_trees_size_n_v1(5));
  assert(42 == find_num_possible_binary_search_trees_size_n_v2(5));
  return (0);
}


x86 assembly (clang, -O0):
<main>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
movl   $0x0,-0x4(%rbp)
mov    $0xfffffff6,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
mov    %eax,%ecx
xor    %eax,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0xfffffff6,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
mov    %eax,%ecx
xor    %eax,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
xor    %edi,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
mov    %eax,%ecx
xor    %eax,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
xor    %edi,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
mov    %eax,%ecx
xor    %eax,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x1,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
mov    %eax,%ecx
mov    $0x1,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x1,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
mov    %eax,%ecx
mov    $0x1,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x2,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
mov    %eax,%ecx
mov    $0x2,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x2,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
mov    %eax,%ecx
mov    $0x2,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x3,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
mov    %eax,%ecx
mov    $0x5,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x3,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
mov    %eax,%ecx
mov    $0x5,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x4,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
mov    %eax,%ecx
mov    $0xe,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x4,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
mov    %eax,%ecx
mov    $0xe,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x5,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
mov    %eax,%ecx
mov    $0x2a,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
mov    $0x5,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
mov    %eax,%ecx
mov    $0x2a,%eax
cmp    %ecx,%eax
sete   %al
and    $0x1,%al
movzbl %al,%edi
call   1040 <assert@plt>
xor    %eax,%eax
add    $0x10,%rsp
pop    %rbp
ret

x86 assembly (clang, -O2):
<main>:
push   %rax
mov    $0xfffffff6,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0xfffffff6,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
xor    %edi,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
xor    %edi,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
xor    %edi,%edi
test   %eax,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x1,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
xor    %edi,%edi
cmp    $0x1,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x1,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
xor    %edi,%edi
cmp    $0x1,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x2,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
xor    %edi,%edi
cmp    $0x2,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x2,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
xor    %edi,%edi
cmp    $0x2,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x3,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
xor    %edi,%edi
cmp    $0x5,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x3,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
xor    %edi,%edi
cmp    $0x5,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x4,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
xor    %edi,%edi
cmp    $0xe,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x4,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
xor    %edi,%edi
cmp    $0xe,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x5,%edi
call   1050 <find_num_possible_binary_search_trees_size_n_v1@plt>
xor    %edi,%edi
cmp    $0x2a,%eax
sete   %dil
call   1040 <assert@plt>
mov    $0x5,%edi
call   1030 <find_num_possible_binary_search_trees_size_n_v2@plt>
xor    %edi,%edi
cmp    $0x2a,%eax
sete   %dil
call   1040 <assert@plt>
xor    %eax,%eax
pop    %rcx
ret

LLVM IR (-O0):
define i32 @main() {
%1 = alloca i32
store i32 0, i32* %1
%2 = call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 -10)
%3 = icmp eq i32 0, %2
%4 = zext i1 %3 to i32
%5 = call i32 @assert(i32 %4)
%6 = call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 -10)
%7 = icmp eq i32 0, %6
%8 = zext i1 %7 to i32
%9 = call i32 @assert(i32 %8)
%10 = call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 0)
%11 = icmp eq i32 0, %10
%12 = zext i1 %11 to i32
%13 = call i32 @assert(i32 %12)
%14 = call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 0)
%15 = icmp eq i32 0, %14
%16 = zext i1 %15 to i32
%17 = call i32 @assert(i32 %16)
%18 = call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 1)
%19 = icmp eq i32 1, %18
%20 = zext i1 %19 to i32
%21 = call i32 @assert(i32 %20)
%22 = call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 1)
%23 = icmp eq i32 1, %22
%24 = zext i1 %23 to i32
%25 = call i32 @assert(i32 %24)
%26 = call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 2)
%27 = icmp eq i32 2, %26
%28 = zext i1 %27 to i32
%29 = call i32 @assert(i32 %28)
%30 = call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 2)
%31 = icmp eq i32 2, %30
%32 = zext i1 %31 to i32
%33 = call i32 @assert(i32 %32)
%34 = call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 3)
%35 = icmp eq i32 5, %34
%36 = zext i1 %35 to i32
%37 = call i32 @assert(i32 %36)
%38 = call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 3)
%39 = icmp eq i32 5, %38
%40 = zext i1 %39 to i32
%41 = call i32 @assert(i32 %40)
%42 = call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 4)
%43 = icmp eq i32 14, %42
%44 = zext i1 %43 to i32
%45 = call i32 @assert(i32 %44)
%46 = call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 4)
%47 = icmp eq i32 14, %46
%48 = zext i1 %47 to i32
%49 = call i32 @assert(i32 %48)
%50 = call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 5)
%51 = icmp eq i32 42, %50
%52 = zext i1 %51 to i32
%53 = call i32 @assert(i32 %52)
%54 = call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 5)
%55 = icmp eq i32 42, %54
%56 = zext i1 %55 to i32
%57 = call i32 @assert(i32 %56)
ret i32 0
}

LLVM IR (-O2):
define i32 @main() {
%1 = tail call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 -10)
%2 = icmp eq i32 %1, 0
%3 = zext i1 %2 to i32
%4 = tail call i32 @assert(i32 %3)
%5 = tail call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 -10)
%6 = icmp eq i32 %5, 0
%7 = zext i1 %6 to i32
%8 = tail call i32 @assert(i32 %7)
%9 = tail call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 0)
%10 = icmp eq i32 %9, 0
%11 = zext i1 %10 to i32
%12 = tail call i32 @assert(i32 %11)
%13 = tail call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 0)
%14 = icmp eq i32 %13, 0
%15 = zext i1 %14 to i32
%16 = tail call i32 @assert(i32 %15)
%17 = tail call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 1)
%18 = icmp eq i32 %17, 1
%19 = zext i1 %18 to i32
%20 = tail call i32 @assert(i32 %19)
%21 = tail call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 1)
%22 = icmp eq i32 %21, 1
%23 = zext i1 %22 to i32
%24 = tail call i32 @assert(i32 %23)
%25 = tail call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 2)
%26 = icmp eq i32 %25, 2
%27 = zext i1 %26 to i32
%28 = tail call i32 @assert(i32 %27)
%29 = tail call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 2)
%30 = icmp eq i32 %29, 2
%31 = zext i1 %30 to i32
%32 = tail call i32 @assert(i32 %31)
%33 = tail call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 3)
%34 = icmp eq i32 %33, 5
%35 = zext i1 %34 to i32
%36 = tail call i32 @assert(i32 %35)
%37 = tail call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 3)
%38 = icmp eq i32 %37, 5
%39 = zext i1 %38 to i32
%40 = tail call i32 @assert(i32 %39)
%41 = tail call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 4)
%42 = icmp eq i32 %41, 14
%43 = zext i1 %42 to i32
%44 = tail call i32 @assert(i32 %43)
%45 = tail call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 4)
%46 = icmp eq i32 %45, 14
%47 = zext i1 %46 to i32
%48 = tail call i32 @assert(i32 %47)
%49 = tail call i32 @find_num_possible_binary_search_trees_size_n_v1(i32 5)
%50 = icmp eq i32 %49, 42
%51 = zext i1 %50 to i32
%52 = tail call i32 @assert(i32 %51)
%53 = tail call i32 @find_num_possible_binary_search_trees_size_n_v2(i32 5)
%54 = icmp eq i32 %53, 42
%55 = zext i1 %54 to i32
%56 = tail call i32 @assert(i32 %55)
ret i32 0
}