#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*/ exit(int);
int /*<<< orphan*/ printf(char *);
void usage(int a_ret) {
  printf("WORD VECTOR estimation toolkit v 0.1c\n\n");
  printf("OPTIONS:\n");
  printf("Parameters for training:\n");
  printf("-train <file>\n");
  printf("\tUse text data from <file> to train the model\n");
  printf("-output <file>\n");
  printf("\tUse <file> to save the resulting word vectors / word clusters\n");
  printf("-size <int>\n");
  printf("\tSet size of word vectors; default is 100\n");
  printf("-window <int>\n");
  printf("\tSet max skip length between words; default is 5\n");
  printf("-sample <float>\n");
  printf("\tSet threshold for occurrence of words. Those that appear with "
         "higher frequency in the\n");
  printf("\ttraining data will be randomly down-sampled; default is 1e-3, "
         "useful range is (0, 1e-5)\n");
  printf("-hs <int>\n");
  printf("\tUse Hierarchical Softmax; default is 0 (not used)\n");
  printf("-negative <int>\n");
  printf("\tNumber of negative examples; default is 5, common values are 3 - "
         "10 (0 = not used)\n");
  printf("-threads <int>\n");
  printf("\tUse <int> threads (default 12)\n");
  printf("-iter <int>\n");
  printf("\tRun more training iterations (default 5)\n");
  printf("-min-count <int>\n");
  printf("\tThis will discard words that appear less than <int> times; default "
         "is 5\n");
  printf("-alpha <float>\n");
  printf("\tSet the starting learning rate; default is 0.025 for skip-gram and "
         "0.05 for CBOW\n");
  printf("-debug <int>\n");
  printf("\tSet the debug mode (default = 2 = more info during training)\n");
  printf("-binary <int>\n");
  printf("\tSave the resulting vectors in binary mode; default is 0 (off)\n");
  printf("-cbow <int>\n");
  printf("\tUse the continuous bag of words model; default is 1 (use 0 for "
         "skip-gram model)\n");
  printf("-ts <int>\n");
  printf(
      "\tTrain task-specific embeddings if the argument is > 0 (labels for "
      "each task\n"
      "\tshould be consecutive integers starting from 0 specified as the last\n"
      "\ttab-separated field on each line, or `_' if the label is unknown and\n"
      "\tthe instance should be skipped); it is possible to specify multiple\n"
      "\tobjectives as tab separated fields at the end of each line;\n");
  printf("-ts-w2v <int>\n");
  printf("\tTrain both normal word2vec and multi-task objectives\n");
  printf("-ts-least-sq <int>\n");
  printf("\tMap generic word2vec vectors to the learned task-specific vectors "
         "using\n"
         "\tthe least squares method\n");
  printf("\nExamples:\n");
  printf("./word2vec -train data.txt -output vec.txt -size 200 -window 5 "
         "-sample 1e-4 -negative 5 -hs 0 -binary 0 -cbow 1 -iter 3\n\n");
  exit(a_ret);
}


x86 assembly (clang, -O0):
<usage>:
push   %rbp
mov    %rsp,%rbp
sub    $0x10,%rsp
mov    %edi,-0x4(%rbp)
lea    0xece(%rip),%rdi
call   1030 <printf@plt>
lea    0xeea(%rip),%rdi
call   1030 <printf@plt>
lea    0xee8(%rip),%rdi
call   1030 <printf@plt>
lea    0xef6(%rip),%rdi
call   1030 <printf@plt>
lea    0xef9(%rip),%rdi
call   1030 <printf@plt>
lea    0xf1c(%rip),%rdi
call   1030 <printf@plt>
lea    0xf20(%rip),%rdi
call   1030 <printf@plt>
lea    0xf54(%rip),%rdi
call   1030 <printf@plt>
lea    0xf55(%rip),%rdi
call   1030 <printf@plt>
lea    0xf74(%rip),%rdi
call   1030 <printf@plt>
lea    0xf77(%rip),%rdi
call   1030 <printf@plt>
lea    0xf9d(%rip),%rdi
call   1030 <printf@plt>
lea    0xfa2(%rip),%rdi
call   1030 <printf@plt>
lea    0xfee(%rip),%rdi
call   1030 <printf@plt>
lea    0x103c(%rip),%rdi
call   1030 <printf@plt>
lea    0x103b(%rip),%rdi
call   1030 <printf@plt>
lea    0x1063(%rip),%rdi
call   1030 <printf@plt>
lea    0x1068(%rip),%rdi
call   1030 <printf@plt>
lea    0x10b1(%rip),%rdi
call   1030 <printf@plt>
lea    0x10b5(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ca(%rip),%rdi
call   1030 <printf@plt>
lea    0x10cb(%rip),%rdi
call   1030 <printf@plt>
lea    0x10ea(%rip),%rdi
call   1030 <printf@plt>
lea    0x10f0(%rip),%rdi
call   1030 <printf@plt>
lea    0x112e(%rip),%rdi
call   1030 <printf@plt>
lea    0x1132(%rip),%rdi
call   1030 <printf@plt>
lea    0x1179(%rip),%rdi
call   1030 <printf@plt>
lea    0x117b(%rip),%rdi
call   1030 <printf@plt>
lea    0x11ae(%rip),%rdi
call   1030 <printf@plt>
lea    0x11b1(%rip),%rdi
call   1030 <printf@plt>
lea    0x11e5(%rip),%rdi
call   1030 <printf@plt>
lea    0x11e6(%rip),%rdi
call   1030 <printf@plt>
lea    0x122c(%rip),%rdi
call   1030 <printf@plt>
lea    0x122b(%rip),%rdi
call   1030 <printf@plt>
lea    0x137b(%rip),%rdi
call   1030 <printf@plt>
lea    0x137e(%rip),%rdi
call   1030 <printf@plt>
lea    0x13a9(%rip),%rdi
call   1030 <printf@plt>
lea    0x13b1(%rip),%rdi
call   1030 <printf@plt>
lea    0x1409(%rip),%rdi
call   1030 <printf@plt>
lea    0x1409(%rip),%rdi
call   1030 <printf@plt>
mov    -0x4(%rbp),%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<usage>:
push   %rbx
mov    %edi,%ebx
lea    0xed6(%rip),%rdi
call   1030 <puts@plt>
lea    0xef1(%rip),%rdi
call   1030 <puts@plt>
lea    0xeee(%rip),%rdi
call   1030 <puts@plt>
lea    0xefb(%rip),%rdi
call   1030 <puts@plt>
lea    0xefd(%rip),%rdi
call   1030 <puts@plt>
lea    0xf1f(%rip),%rdi
call   1030 <puts@plt>
lea    0xf22(%rip),%rdi
call   1030 <puts@plt>
lea    0xf55(%rip),%rdi
call   1030 <puts@plt>
lea    0xf55(%rip),%rdi
call   1030 <puts@plt>
lea    0xf73(%rip),%rdi
call   1030 <puts@plt>
lea    0xf75(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf9e(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe9(%rip),%rdi
call   1030 <puts@plt>
lea    0x1036(%rip),%rdi
call   1030 <puts@plt>
lea    0x1034(%rip),%rdi
call   1030 <puts@plt>
lea    0x105b(%rip),%rdi
call   1030 <puts@plt>
lea    0x105f(%rip),%rdi
call   1030 <puts@plt>
lea    0x10a7(%rip),%rdi
call   1030 <puts@plt>
lea    0x10aa(%rip),%rdi
call   1030 <puts@plt>
lea    0x10be(%rip),%rdi
call   1030 <puts@plt>
lea    0x10be(%rip),%rdi
call   1030 <puts@plt>
lea    0x10dc(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e1(%rip),%rdi
call   1030 <puts@plt>
lea    0x111e(%rip),%rdi
call   1030 <puts@plt>
lea    0x1121(%rip),%rdi
call   1030 <puts@plt>
lea    0x1167(%rip),%rdi
call   1030 <puts@plt>
lea    0x1168(%rip),%rdi
call   1030 <puts@plt>
lea    0x119a(%rip),%rdi
call   1030 <puts@plt>
lea    0x119c(%rip),%rdi
call   1030 <puts@plt>
lea    0x11cf(%rip),%rdi
call   1030 <puts@plt>
lea    0x11cf(%rip),%rdi
call   1030 <puts@plt>
lea    0x1214(%rip),%rdi
call   1030 <puts@plt>
lea    0x1212(%rip),%rdi
call   1030 <puts@plt>
lea    0x1361(%rip),%rdi
call   1030 <puts@plt>
lea    0x1363(%rip),%rdi
call   1030 <puts@plt>
lea    0x138d(%rip),%rdi
call   1030 <puts@plt>
lea    0x1394(%rip),%rdi
call   1030 <puts@plt>
lea    0x13eb(%rip),%rdi
call   1030 <puts@plt>
lea    0x13ea(%rip),%rdi
call   1030 <puts@plt>
mov    %ebx,%edi
call   1040 <exit@plt>

LLVM IR (-O0):
@.str = [40 x i8] c"WORD VECTOR estimation toolkit v 0.1c\0A\0A\00"
@.str.1 = [10 x i8] c"OPTIONS:\0A\00"
@.str.2 = [26 x i8] c"Parameters for training:\0A\00"
@.str.3 = [15 x i8] c"-train <file>\0A\00"
@.str.4 = [47 x i8] c"\09Use text data from <file> to train the model\0A\00"
@.str.5 = [16 x i8] c"-output <file>\0A\00"
@.str.6 = [64 x i8] c"\09Use <file> to save the resulting word vectors / word clusters\0A\00"
@.str.7 = [13 x i8] c"-size <int>\0A\00"
@.str.8 = [43 x i8] c"\09Set size of word vectors; default is 100\0A\00"
@.str.9 = [15 x i8] c"-window <int>\0A\00"
@.str.10 = [50 x i8] c"\09Set max skip length between words; default is 5\0A\00"
@.str.11 = [17 x i8] c"-sample <float>\0A\00"
@.str.12 = [88 x i8] c"\09Set threshold for occurrence of words. Those that appear with higher frequency in the\0A\00"
@.str.13 = [90 x i8] c"\09training data will be randomly down-sampled; default is 1e-3, useful range is (0, 1e-5)\0A\00"
@.str.14 = [11 x i8] c"-hs <int>\0A\00"
@.str.15 = [52 x i8] c"\09Use Hierarchical Softmax; default is 0 (not used)\0A\00"
@.str.16 = [17 x i8] c"-negative <int>\0A\00"
@.str.17 = [85 x i8] c"\09Number of negative examples; default is 5, common values are 3 - 10 (0 = not used)\0A\00"
@.str.18 = [16 x i8] c"-threads <int>\0A\00"
@.str.19 = [33 x i8] c"\09Use <int> threads (default 12)\0A\00"
@.str.20 = [13 x i8] c"-iter <int>\0A\00"
@.str.21 = [43 x i8] c"\09Run more training iterations (default 5)\0A\00"
@.str.22 = [18 x i8] c"-min-count <int>\0A\00"
@.str.23 = [74 x i8] c"\09This will discard words that appear less than <int> times; default is 5\0A\00"
@.str.24 = [16 x i8] c"-alpha <float>\0A\00"
@.str.25 = [83 x i8] c"\09Set the starting learning rate; default is 0.025 for skip-gram and 0.05 for CBOW\0A\00"
@.str.26 = [14 x i8] c"-debug <int>\0A\00"
@.str.27 = [63 x i8] c"\09Set the debug mode (default = 2 = more info during training)\0A\00"
@.str.28 = [15 x i8] c"-binary <int>\0A\00"
@.str.29 = [64 x i8] c"\09Save the resulting vectors in binary mode; default is 0 (off)\0A\00"
@.str.30 = [13 x i8] c"-cbow <int>\0A\00"
@.str.31 = [82 x i8] c"\09Use the continuous bag of words model; default is 1 (use 0 for skip-gram model)\0A\00"
@.str.32 = [11 x i8] c"-ts <int>\0A\00"
@.str.33 = [348 x i8] c"\09Train task-specific embeddings if the argument is > 0 (labels for each task\0A\09should be consecutive integers starting from 0 specified as the last\0A\09tab-separated field on each line, or `_' if the label is unknown and\0A\09the instance should be skipped); it is possible to specify multiple\0A\09objectives as tab separated fields at the end of each line;\0A\00"
@.str.34 = [15 x i8] c"-ts-w2v <int>\0A\00"
@.str.35 = [55 x i8] c"\09Train both normal word2vec and multi-task objectives\0A\00"
@.str.36 = [20 x i8] c"-ts-least-sq <int>\0A\00"
@.str.37 = [100 x i8] c"\09Map generic word2vec vectors to the learned task-specific vectors using\0A\09the least squares method\0A\00"
@.str.38 = [12 x i8] c"\0AExamples:\0A\00"
@.str.39 = [122 x i8] c"./word2vec -train data.txt -output vec.txt -size 200 -window 5 -sample 1e-4 -negative 5 -hs 0 -binary 0 -cbow 1 -iter 3\0A\0A\00"
define void @usage(i32 %0) {
%2 = alloca i32
store i32 %0, i32* %2
%3 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.1, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([26 x i8], [26 x i8]* @.str.2, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.3, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.4, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.5, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.6, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.7, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.8, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.9, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([50 x i8], [50 x i8]* @.str.10, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.11, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([88 x i8], [88 x i8]* @.str.12, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([90 x i8], [90 x i8]* @.str.13, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.14, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([52 x i8], [52 x i8]* @.str.15, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([17 x i8], [17 x i8]* @.str.16, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([85 x i8], [85 x i8]* @.str.17, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.18, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([33 x i8], [33 x i8]* @.str.19, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.20, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([43 x i8], [43 x i8]* @.str.21, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([18 x i8], [18 x i8]* @.str.22, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.23, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([16 x i8], [16 x i8]* @.str.24, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([83 x i8], [83 x i8]* @.str.25, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.26, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str.27, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.28, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([64 x i8], [64 x i8]* @.str.29, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.30, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([82 x i8], [82 x i8]* @.str.31, i64 0, i64 0))
%35 = call i32 @printf(i8* getelementptr inbounds ([11 x i8], [11 x i8]* @.str.32, i64 0, i64 0))
%36 = call i32 @printf(i8* getelementptr inbounds ([348 x i8], [348 x i8]* @.str.33, i64 0, i64 0))
%37 = call i32 @printf(i8* getelementptr inbounds ([15 x i8], [15 x i8]* @.str.34, i64 0, i64 0))
%38 = call i32 @printf(i8* getelementptr inbounds ([55 x i8], [55 x i8]* @.str.35, i64 0, i64 0))
%39 = call i32 @printf(i8* getelementptr inbounds ([20 x i8], [20 x i8]* @.str.36, i64 0, i64 0))
%40 = call i32 @printf(i8* getelementptr inbounds ([100 x i8], [100 x i8]* @.str.37, i64 0, i64 0))
%41 = call i32 @printf(i8* getelementptr inbounds ([12 x i8], [12 x i8]* @.str.38, i64 0, i64 0))
%42 = call i32 @printf(i8* getelementptr inbounds ([122 x i8], [122 x i8]* @.str.39, i64 0, i64 0))
%43 = load i32, i32* %2
%44 = call i32 @exit(i32 %43)
unreachable
}

LLVM IR (-O2):
@str = [39 x i8] c"WORD VECTOR estimation toolkit v 0.1c\0A\00"
@str.40 = [9 x i8] c"OPTIONS:\00"
@str.41 = [25 x i8] c"Parameters for training:\00"
@str.42 = [14 x i8] c"-train <file>\00"
@str.43 = [46 x i8] c"\09Use text data from <file> to train the model\00"
@str.44 = [15 x i8] c"-output <file>\00"
@str.45 = [63 x i8] c"\09Use <file> to save the resulting word vectors / word clusters\00"
@str.46 = [12 x i8] c"-size <int>\00"
@str.47 = [42 x i8] c"\09Set size of word vectors; default is 100\00"
@str.48 = [14 x i8] c"-window <int>\00"
@str.49 = [49 x i8] c"\09Set max skip length between words; default is 5\00"
@str.50 = [16 x i8] c"-sample <float>\00"
@str.51 = [87 x i8] c"\09Set threshold for occurrence of words. Those that appear with higher frequency in the\00"
@str.52 = [89 x i8] c"\09training data will be randomly down-sampled; default is 1e-3, useful range is (0, 1e-5)\00"
@str.53 = [10 x i8] c"-hs <int>\00"
@str.54 = [51 x i8] c"\09Use Hierarchical Softmax; default is 0 (not used)\00"
@str.55 = [16 x i8] c"-negative <int>\00"
@str.56 = [84 x i8] c"\09Number of negative examples; default is 5, common values are 3 - 10 (0 = not used)\00"
@str.57 = [15 x i8] c"-threads <int>\00"
@str.58 = [32 x i8] c"\09Use <int> threads (default 12)\00"
@str.59 = [12 x i8] c"-iter <int>\00"
@str.60 = [42 x i8] c"\09Run more training iterations (default 5)\00"
@str.61 = [17 x i8] c"-min-count <int>\00"
@str.62 = [73 x i8] c"\09This will discard words that appear less than <int> times; default is 5\00"
@str.63 = [15 x i8] c"-alpha <float>\00"
@str.64 = [82 x i8] c"\09Set the starting learning rate; default is 0.025 for skip-gram and 0.05 for CBOW\00"
@str.65 = [13 x i8] c"-debug <int>\00"
@str.66 = [62 x i8] c"\09Set the debug mode (default = 2 = more info during training)\00"
@str.67 = [14 x i8] c"-binary <int>\00"
@str.68 = [63 x i8] c"\09Save the resulting vectors in binary mode; default is 0 (off)\00"
@str.69 = [12 x i8] c"-cbow <int>\00"
@str.70 = [81 x i8] c"\09Use the continuous bag of words model; default is 1 (use 0 for skip-gram model)\00"
@str.71 = [10 x i8] c"-ts <int>\00"
@str.72 = [347 x i8] c"\09Train task-specific embeddings if the argument is > 0 (labels for each task\0A\09should be consecutive integers starting from 0 specified as the last\0A\09tab-separated field on each line, or `_' if the label is unknown and\0A\09the instance should be skipped); it is possible to specify multiple\0A\09objectives as tab separated fields at the end of each line;\00"
@str.73 = [14 x i8] c"-ts-w2v <int>\00"
@str.74 = [54 x i8] c"\09Train both normal word2vec and multi-task objectives\00"
@str.75 = [19 x i8] c"-ts-least-sq <int>\00"
@str.76 = [99 x i8] c"\09Map generic word2vec vectors to the learned task-specific vectors using\0A\09the least squares method\00"
@str.77 = [11 x i8] c"\0AExamples:\00"
@str.78 = [121 x i8] c"./word2vec -train data.txt -output vec.txt -size 200 -window 5 -sample 1e-4 -negative 5 -hs 0 -binary 0 -cbow 1 -iter 3\0A\00"
define void @usage(i32 %0) {
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.40, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([25 x i8], [25 x i8]* @str.41, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.42, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.43, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.44, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.45, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([12 x i8], [12 x i8]* @str.46, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.47, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.48, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([49 x i8], [49 x i8]* @str.49, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str.50, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([87 x i8], [87 x i8]* @str.51, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([89 x i8], [89 x i8]* @str.52, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @str.53, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([51 x i8], [51 x i8]* @str.54, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([16 x i8], [16 x i8]* @str.55, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([84 x i8], [84 x i8]* @str.56, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.57, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([32 x i8], [32 x i8]* @str.58, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([12 x i8], [12 x i8]* @str.59, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([42 x i8], [42 x i8]* @str.60, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([17 x i8], [17 x i8]* @str.61, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.62, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([15 x i8], [15 x i8]* @str.63, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([82 x i8], [82 x i8]* @str.64, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.65, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str.66, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.67, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([63 x i8], [63 x i8]* @str.68, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([12 x i8], [12 x i8]* @str.69, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([81 x i8], [81 x i8]* @str.70, i64 0, i64 0))
%34 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([10 x i8], [10 x i8]* @str.71, i64 0, i64 0))
%35 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([347 x i8], [347 x i8]* @str.72, i64 0, i64 0))
%36 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([14 x i8], [14 x i8]* @str.73, i64 0, i64 0))
%37 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([54 x i8], [54 x i8]* @str.74, i64 0, i64 0))
%38 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([19 x i8], [19 x i8]* @str.75, i64 0, i64 0))
%39 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([99 x i8], [99 x i8]* @str.76, i64 0, i64 0))
%40 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([11 x i8], [11 x i8]* @str.77, i64 0, i64 0))
%41 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([121 x i8], [121 x i8]* @str.78, i64 0, i64 0))
%42 = tail call i32 @exit(i32 %0)
unreachable
}