#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*/ printf(char *);
void btk_help_vanity(void) {
  printf("COMMAND\n");
  printf("\n");
  printf("   vanity - generate a vanity address.\n");
  printf("\n");
  printf("SYNOPSIS\n");
  printf("\n");
  printf("   btk vanity [OPTIONS]\n");
  printf("\n");
  printf("DESCRIPTION\n");
  printf("\n");
  printf("   The vanity command will read an input string from standard input "
         "and\n");
  printf("   continuously generate bitcoin addresses until it finds one whose "
         "initial\n");
  printf("   non-static characters match the input string provided. Note that "
         "the vanity\n");
  printf("   command attempts to match your input string after any static "
         "character\n");
  printf("   components of the address. Only include the vanity characters in "
         "your input\n");
  printf("   string. Do not include preceding static characters.\n");
  printf("\n");
  printf(
      "   If no options are specified, the vanity command will search for a\n");
  printf("   traditional compressed bitcoin address. Options exist for "
         "uncompressed,\n");
  printf("   bech32, and testnet addresses. If the -i option is specified, the "
         "vanity\n");
  printf("   command will perform a case insensitive match\n");
  printf("\n");
  printf("   See OPTIONS for more info.\n");
  printf("\n");
  printf("OPTIONS\n");
  printf("\n");
  printf("   -A\n");
  printf("      Match a traditional bitcoin (A)ddress. (default)\n");
  printf("\n");
  printf("   -B\n");
  printf("      Match a (B)ech32 address.\n");
  printf("\n");
  printf("   -C\n");
  printf("      Match a (C)ompressed address. (default)\n");
  printf("\n");
  printf("   -U\n");
  printf("      Match an (U)ncompressed address. Note that this option is not "
         "allowed for\n");
  printf("      bech32 addresses.\n");
  printf("\n");
  printf("   -T\n");
  printf("      Generate a TESTNET address.\n");
  printf("\n");
  printf("   -i\n");
  printf("      Perform a case (i)nsensitive match. Note that this option is "
         "not useful\n");
  printf("      for bech32 addresses as all characters are lowercase.\n");
  printf("\n");
  printf("See https://github.com/bartobri/bitcoin-toolkit for examples.\n");
  printf("See 'btk help' to read about other commands.\n");
  printf("\n");
}


x86 assembly (clang, -O0):
<btk_help_vanity>:
push   %rbp
mov    %rsp,%rbp
lea    0xee5(%rip),%rdi
call   1030 <printf@plt>
lea    0x1269(%rip),%rdi
call   1030 <printf@plt>
lea    0xed6(%rip),%rdi
call   1030 <printf@plt>
lea    0x1251(%rip),%rdi
call   1030 <printf@plt>
lea    0xee6(%rip),%rdi
call   1030 <printf@plt>
lea    0x1239(%rip),%rdi
call   1030 <printf@plt>
lea    0xed8(%rip),%rdi
call   1030 <printf@plt>
lea    0x1221(%rip),%rdi
call   1030 <printf@plt>
lea    0xed9(%rip),%rdi
call   1030 <printf@plt>
lea    0x1209(%rip),%rdi
call   1030 <printf@plt>
lea    0xece(%rip),%rdi
call   1030 <printf@plt>
lea    0xf0b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf4c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf90(%rip),%rdi
call   1030 <printf@plt>
lea    0xfcf(%rip),%rdi
call   1030 <printf@plt>
lea    0x1013(%rip),%rdi
call   1030 <printf@plt>
lea    0x11b5(%rip),%rdi
call   1030 <printf@plt>
lea    0x1033(%rip),%rdi
call   1030 <printf@plt>
lea    0x106d(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ad(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ee(%rip),%rdi
call   1030 <printf@plt>
lea    0x1179(%rip),%rdi
call   1030 <printf@plt>
lea    0x1108(%rip),%rdi
call   1030 <printf@plt>
lea    0x1161(%rip),%rdi
call   1030 <printf@plt>
lea    0x110f(%rip),%rdi
call   1030 <printf@plt>
lea    0x1149(%rip),%rdi
call   1030 <printf@plt>
lea    0x1100(%rip),%rdi
call   1030 <printf@plt>
lea    0x10fb(%rip),%rdi
call   1030 <printf@plt>
lea    0x1125(%rip),%rdi
call   1030 <printf@plt>
lea    0x111b(%rip),%rdi
call   1030 <printf@plt>
lea    0x1116(%rip),%rdi
call   1030 <printf@plt>
lea    0x1101(%rip),%rdi
call   1030 <printf@plt>
lea    0x111f(%rip),%rdi
call   1030 <printf@plt>
lea    0x111a(%rip),%rdi
call   1030 <printf@plt>
lea    0x10dd(%rip),%rdi
call   1030 <printf@plt>
lea    0x1131(%rip),%rdi
call   1030 <printf@plt>
lea    0x112c(%rip),%rdi
call   1030 <printf@plt>
lea    0x1171(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ad(%rip),%rdi
call   1030 <printf@plt>
lea    0x1172(%rip),%rdi
call   1030 <printf@plt>
lea    0x116d(%rip),%rdi
call   1030 <printf@plt>
lea    0x1089(%rip),%rdi
call   1030 <printf@plt>
lea    0x1178(%rip),%rdi
call   1030 <printf@plt>
lea    0x1173(%rip),%rdi
call   1030 <printf@plt>
lea    0x11b6(%rip),%rdi
call   1030 <printf@plt>
lea    0x1059(%rip),%rdi
call   1030 <printf@plt>
lea    0x11db(%rip),%rdi
call   1030 <printf@plt>
lea    0x120e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1035(%rip),%rdi
call   1030 <printf@plt>
pop    %rbp
ret

x86 assembly (clang, -O2):
<btk_help_vanity>:
push   %rax
lea    0xed8(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xeca(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xedb(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xece(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xed0(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0xec6(%rip),%rdi
call   1040 <puts@plt>
lea    0xf02(%rip),%rdi
call   1040 <puts@plt>
lea    0xf42(%rip),%rdi
call   1040 <puts@plt>
lea    0xf85(%rip),%rdi
call   1040 <puts@plt>
lea    0xfc3(%rip),%rdi
call   1040 <puts@plt>
lea    0x1006(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1027(%rip),%rdi
call   1040 <puts@plt>
lea    0x1060(%rip),%rdi
call   1040 <puts@plt>
lea    0x109f(%rip),%rdi
call   1040 <puts@plt>
lea    0x10df(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x10fa(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1102(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x10f4(%rip),%rdi
call   1040 <puts@plt>
lea    0x10ee(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x110f(%rip),%rdi
call   1040 <puts@plt>
lea    0x1109(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1113(%rip),%rdi
call   1040 <puts@plt>
lea    0x110d(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1125(%rip),%rdi
call   1040 <puts@plt>
lea    0x111f(%rip),%rdi
call   1040 <puts@plt>
lea    0x1163(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x1165(%rip),%rdi
call   1040 <puts@plt>
lea    0x115f(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x116b(%rip),%rdi
call   1040 <puts@plt>
lea    0x1165(%rip),%rdi
call   1040 <puts@plt>
lea    0x11a7(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
call   1030 <putchar@plt>
lea    0x11cd(%rip),%rdi
call   1040 <puts@plt>
lea    0x11ff(%rip),%rdi
call   1040 <puts@plt>
mov    $0xa,%edi
pop    %rax
jmp    1030 <putchar@plt>

LLVM IR (-O0):
@.str = [9 x i8] c"COMMAND\0A\00"
@.str.1 = [2 x i8] c"\0A\00"
@.str.2 = [40 x i8] c" vanity - generate a vanity address.\0A\00"
@.str.3 = [10 x i8] c"SYNOPSIS\0A\00"
@.str.4 = [25 x i8] c" btk vanity [OPTIONS]\0A\00"
@.str.5 = [13 x i8] c"DESCRIPTION\0A\00"
@.str.6 = [73 x i8] c" The vanity command will read an input string from standard input and\0A\00"
@.str.7 = [77 x i8] c" continuously generate bitcoin addresses until it finds one whose initial\0A\00"
@.str.8 = [80 x i8] c" non-static characters match the input string provided. Note that the vanity\0A\00"
@.str.9 = [75 x i8] c" command attempts to match your input string after any static character\0A\00"
@.str.10 = [80 x i8] c" components of the address. Only include the vanity characters in your input\0A\00"
@.str.11 = [56 x i8] c" string. Do not include preceding static characters.\0A\00"
@.str.12 = [70 x i8] c" If no options are specified, the vanity command will search for a\0A\00"
@.str.13 = [76 x i8] c" traditional compressed bitcoin address. Options exist for uncompressed,\0A\00"
@.str.14 = [77 x i8] c" bech32, and testnet addresses. If the -i option is specified, the vanity\0A\00"
@.str.15 = [50 x i8] c" command will perform a case insensitive match\0A\00"
@.str.16 = [31 x i8] c" See OPTIONS for more info.\0A\00"
@.str.17 = [9 x i8] c"OPTIONS\0A\00"
@.str.18 = [7 x i8] c" -A\0A\00"
@.str.19 = [56 x i8] c" Match a traditional bitcoin (A)ddress. (default)\0A\00"
@.str.20 = [7 x i8] c" -B\0A\00"
@.str.21 = [33 x i8] c" Match a (B)ech32 address.\0A\00"
@.str.22 = [7 x i8] c" -C\0A\00"
@.str.23 = [47 x i8] c" Match a (C)ompressed address. (default)\0A\00"
@.str.24 = [7 x i8] c" -U\0A\00"
@.str.25 = [81 x i8] c" Match an (U)ncompressed address. Note that this option is not allowed for\0A\00"
@.str.26 = [25 x i8] c" bech32 addresses.\0A\00"
@.str.27 = [7 x i8] c" -T\0A\00"
@.str.28 = [35 x i8] c" Generate a TESTNET address.\0A\00"
@.str.29 = [7 x i8] c" -i\0A\00"
@.str.30 = [79 x i8] c" Perform a case (i)nsensitive match. Note that this option is not useful\0A\00"
@.str.31 = [61 x i8] c" for bech32 addresses as all characters are lowercase.\0A\00"
@.str.32 = [63 x i8] c"See https://github.com/bartobri/bitcoin-toolkit for examples.\0A\00"
@.str.33 = [46 x i8] c"See 'btk help' to read about other commands.\0A\00"
define void @btk_help_vanity() {
%1 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.3, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.4, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.5, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.6, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.7, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.8, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.9, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.10, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.11, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.12, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.13, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.14, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.15, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([31 x i8], [31 x i8]* @.str.16, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([9 x i8], [9 x i8]* @.str.17, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.18, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([56 x i8], [56 x i8]* @.str.19, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.20, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.21, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.22, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.23, i64 0, i64 0))
%35 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%36 = call i32 @printf(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.24, i64 0, i64 0))
%37 = call i32 @printf(i8* getelementptr inbounds ([81 x i8], [81 x i8]* @.str.25, i64 0, i64 0))
%38 = call i32 @printf(i8* getelementptr inbounds ([25 x i8], [25 x i8]* @.str.26, i64 0, i64 0))
%39 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%40 = call i32 @printf(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.27, i64 0, i64 0))
%41 = call i32 @printf(i8* getelementptr inbounds ([35 x i8], [35 x i8]* @.str.28, i64 0, i64 0))
%42 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%43 = call i32 @printf(i8* getelementptr inbounds ([7 x i8], [7 x i8]* @.str.29, i64 0, i64 0))
%44 = call i32 @printf(i8* getelementptr inbounds ([79 x i8], [79 x i8]* @.str.30, i64 0, i64 0))
%45 = call i32 @printf(i8* getelementptr inbounds ([61 x i8], [61 x i8]* @.str.31, i64 0, i64 0))
%46 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
%47 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.32, i64 0, i64 0))
%48 = call i32 @printf(i8* getelementptr inbounds ([46 x i8], [46 x i8]* @.str.33, i64 0, i64 0))
%49 = call i32 @printf(i8* getelementptr inbounds ([2 x i8], [2 x i8]* @.str.1, i64 0, i64 0))
ret void
}

LLVM IR (-O2):
@str = [8 x i8] c"COMMAND\00"
@str.34 = [39 x i8] c" vanity - generate a vanity address.\00"
@str.35 = [9 x i8] c"SYNOPSIS\00"
@str.36 = [24 x i8] c" btk vanity [OPTIONS]\00"
@str.37 = [12 x i8] c"DESCRIPTION\00"
@str.38 = [72 x i8] c" The vanity command will read an input string from standard input and\00"
@str.39 = [76 x i8] c" continuously generate bitcoin addresses until it finds one whose initial\00"
@str.40 = [79 x i8] c" non-static characters match the input string provided. Note that the vanity\00"
@str.41 = [74 x i8] c" command attempts to match your input string after any static character\00"
@str.42 = [79 x i8] c" components of the address. Only include the vanity characters in your input\00"
@str.43 = [55 x i8] c" string. Do not include preceding static characters.\00"
@str.44 = [69 x i8] c" If no options are specified, the vanity command will search for a\00"
@str.45 = [75 x i8] c" traditional compressed bitcoin address. Options exist for uncompressed,\00"
@str.46 = [76 x i8] c" bech32, and testnet addresses. If the -i option is specified, the vanity\00"
@str.47 = [49 x i8] c" command will perform a case insensitive match\00"
@str.48 = [30 x i8] c" See OPTIONS for more info.\00"
@str.49 = [8 x i8] c"OPTIONS\00"
@str.50 = [6 x i8] c" -A\00"
@str.51 = [55 x i8] c" Match a traditional bitcoin (A)ddress. (default)\00"
@str.52 = [6 x i8] c" -B\00"
@str.53 = [32 x i8] c" Match a (B)ech32 address.\00"
@str.54 = [6 x i8] c" -C\00"
@str.55 = [46 x i8] c" Match a (C)ompressed address. (default)\00"
@str.56 = [6 x i8] c" -U\00"
@str.57 = [80 x i8] c" Match an (U)ncompressed address. Note that this option is not allowed for\00"
@str.58 = [24 x i8] c" bech32 addresses.\00"
@str.59 = [6 x i8] c" -T\00"
@str.60 = [34 x i8] c" Generate a TESTNET address.\00"
@str.61 = [6 x i8] c" -i\00"
@str.62 = [78 x i8] c" Perform a case (i)nsensitive match. Note that this option is not useful\00"
@str.63 = [60 x i8] c" for bech32 addresses as all characters are lowercase.\00"
@str.64 = [62 x i8] c"See https://github.com/bartobri/bitcoin-toolkit for examples.\00"
@str.65 = [45 x i8] c"See 'btk help' to read about other commands.\00"
define void @btk_help_vanity() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([8 x i8], [8 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @putchar(i32 10)
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.34, i64 0, i64 0))
%4 = tail call i32 @putchar(i32 10)
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.35, i64 0, i64 0))
%6 = tail call i32 @putchar(i32 10)
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.36, i64 0, i64 0))
%8 = tail call i32 @putchar(i32 10)
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([12 x i8], [12 x i8]* @str.37, i64 0, i64 0))
%10 = tail call i32 @putchar(i32 10)
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.38, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.39, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.40, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.41, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.42, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.43, i64 0, i64 0))
%17 = tail call i32 @putchar(i32 10)
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.44, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.45, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.46, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.47, i64 0, i64 0))
%22 = tail call i32 @putchar(i32 10)
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([30 x i8], [30 x i8]* @str.48, i64 0, i64 0))
%24 = tail call i32 @putchar(i32 10)
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([8 x i8], [8 x i8]* @str.49, i64 0, i64 0))
%26 = tail call i32 @putchar(i32 10)
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([6 x i8], [6 x i8]* @str.50, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([55 x i8], [55 x i8]* @str.51, i64 0, i64 0))
%29 = tail call i32 @putchar(i32 10)
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([6 x i8], [6 x i8]* @str.52, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.53, i64 0, i64 0))
%32 = tail call i32 @putchar(i32 10)
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([6 x i8], [6 x i8]* @str.54, i64 0, i64 0))
%34 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.55, i64 0, i64 0))
%35 = tail call i32 @putchar(i32 10)
%36 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([6 x i8], [6 x i8]* @str.56, i64 0, i64 0))
%37 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([80 x i8], [80 x i8]* @str.57, i64 0, i64 0))
%38 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([24 x i8], [24 x i8]* @str.58, i64 0, i64 0))
%39 = tail call i32 @putchar(i32 10)
%40 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([6 x i8], [6 x i8]* @str.59, i64 0, i64 0))
%41 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([34 x i8], [34 x i8]* @str.60, i64 0, i64 0))
%42 = tail call i32 @putchar(i32 10)
%43 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([6 x i8], [6 x i8]* @str.61, i64 0, i64 0))
%44 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([78 x i8], [78 x i8]* @str.62, i64 0, i64 0))
%45 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([60 x i8], [60 x i8]* @str.63, i64 0, i64 0))
%46 = tail call i32 @putchar(i32 10)
%47 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.64, i64 0, i64 0))
%48 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([45 x i8], [45 x i8]* @str.65, i64 0, i64 0))
%49 = tail call i32 @putchar(i32 10)
ret void
}