#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 /*<<< orphan*/);
int /*<<< orphan*/ printf(char *);
void info() {
  printf("Usage: getnodes <grid file> [-i <node type>] [-o <node type>]\n");
  printf("                [-m <mask file>] [-v] [-x|-y]\n");
  printf("Where:\n");
  printf(
      "  <grid file> -- text file with node coordinates (see remarks below)\n");
  printf("    (use \"stdin\" or \"-\" for standard input)\n");
  printf("Options:\n");
  printf("  -i <node type> -- input node type\n");
  printf("  -m <mask file> -- text file with nce1 x nce2 lines containing "
         "\"0\" or \"1\"\n");
  printf("    (use \"stdin\" or \"-\" for standard input)\n");
  printf("  -o <node type> -- output node type\n");
  printf("  -p -- tweak a bi- or tri- polar grid to a representation that can "
         "be\n");
  printf("        mapped (xy <-> ij) by using gridmap structure (node "
         "coordinates\n");
  printf("        are assumed to be in degrees)\n");
  printf("  -v -- verbose / version\n");
  printf("  -x -- print X coordinates only\n");
  printf("  -y -- print Y coordinates only\n");
  printf("Node types:\n");
  printf("  DD -- double density nodes (default) \n");
  printf("  CE -- cell center nodes\n");
  printf("  CO -- cell corner nodes\n");
  printf("Description:\n");
  printf("  `getnodes' (i) reads input grid nodes in \"X Y\" format;\n");
  printf(
      "   (ii) validates them (sets node values for empty cells to NaNs);\n");
  printf(
      "   (iii) if necessary, converts the nodes to a specified node type;\n");
  printf("   (iv) prints the requested nodes.\n");
  printf("Remarks:\n");
  printf("  1. The grid file must contain header describing the node array "
         "dimension:\n");
  printf("     ## <nx> x <ny>\n");
  printf("     where for double density nodes nx = nce1 * 2 + 1, ny = nce2 * 2 "
         "+ 1;\n");
  printf("     for corner nodes  nx = nce1 + 1, ny = nce2 + 1; and for center "
         "nodes\n");
  printf("     nx = nce1, ny = nce2.\n");
  printf("  2. After the header, the grid file must contain (nx * ny) lines "
         "with X and Y\n");
  printf("     node coordinates.\n");
  printf("  3. An empty or commented line in the input grid file as well as "
         "NaNs for\n");
  printf("     node coordinates indicate an invalid node.\n");
  printf("  4. An optional mask file is a file with nce1 x nce2 lines "
         "containing \"1\" for\n");
  printf("     valid cells and \"0\" for invalid cells.\n");
  printf("  5. A grid cell is valid if all four corner nodes are valid (not "
         "NaNs).\n");
  printf("     If a cell mask was specified, then a valid corner node must "
         "also have\n");
  printf("     at least one valid neigbour cell.\n");
  printf("  6. The grid (union of all valid grid cells) must be simply "
         "connected.\n");
  exit(0);
}


x86 assembly (clang, -O0):
<info>:
push   %rbp
mov    %rsp,%rbp
lea    0xed5(%rip),%rdi
call   1030 <printf@plt>
lea    0xf08(%rip),%rdi
call   1030 <printf@plt>
lea    0xf2b(%rip),%rdi
call   1030 <printf@plt>
lea    0xf27(%rip),%rdi
call   1030 <printf@plt>
lea    0xf61(%rip),%rdi
call   1030 <printf@plt>
lea    0xf82(%rip),%rdi
call   1030 <printf@plt>
lea    0xf80(%rip),%rdi
call   1030 <printf@plt>
lea    0xf99(%rip),%rdi
call   1030 <printf@plt>
lea    0xf31(%rip),%rdi
call   1030 <printf@plt>
lea    0xfcd(%rip),%rdi
call   1030 <printf@plt>
lea    0xfe7(%rip),%rdi
call   1030 <printf@plt>
lea    0x1023(%rip),%rdi
call   1030 <printf@plt>
lea    0x1060(%rip),%rdi
call   1030 <printf@plt>
lea    0x107b(%rip),%rdi
call   1030 <printf@plt>
lea    0x108a(%rip),%rdi
call   1030 <printf@plt>
lea    0x10a0(%rip),%rdi
call   1030 <printf@plt>
lea    0x10b6(%rip),%rdi
call   1030 <printf@plt>
lea    0x10b7(%rip),%rdi
call   1030 <printf@plt>
lea    0x10d4(%rip),%rdi
call   1030 <printf@plt>
lea    0x10e3(%rip),%rdi
call   1030 <printf@plt>
lea    0x10f2(%rip),%rdi
call   1030 <printf@plt>
lea    0x10f4(%rip),%rdi
call   1030 <printf@plt>
lea    0x1122(%rip),%rdi
call   1030 <printf@plt>
lea    0x115a(%rip),%rdi
call   1030 <printf@plt>
lea    0x1193(%rip),%rdi
call   1030 <printf@plt>
lea    0x11ac(%rip),%rdi
call   1030 <printf@plt>
lea    0x11aa(%rip),%rdi
call   1030 <printf@plt>
lea    0x11eb(%rip),%rdi
call   1030 <printf@plt>
lea    0x11f4(%rip),%rdi
call   1030 <printf@plt>
lea    0x1233(%rip),%rdi
call   1030 <printf@plt>
lea    0x1272(%rip),%rdi
call   1030 <printf@plt>
lea    0x1282(%rip),%rdi
call   1030 <printf@plt>
lea    0x12c6(%rip),%rdi
call   1030 <printf@plt>
lea    0x12d2(%rip),%rdi
call   1030 <printf@plt>
lea    0x1312(%rip),%rdi
call   1030 <printf@plt>
lea    0x1337(%rip),%rdi
call   1030 <printf@plt>
lea    0x137b(%rip),%rdi
call   1030 <printf@plt>
lea    0x139c(%rip),%rdi
call   1030 <printf@plt>
lea    0x13da(%rip),%rdi
call   1030 <printf@plt>
lea    0x141a(%rip),%rdi
call   1030 <printf@plt>
lea    0x1436(%rip),%rdi
call   1030 <printf@plt>
xor    %edi,%edi
call   1040 <exit@plt>

x86 assembly (clang, -O2):
<info>:
push   %rbx
lea    0xed8(%rip),%rdi
call   1030 <puts@plt>
lea    0xf0a(%rip),%rdi
call   1030 <puts@plt>
lea    0xf2c(%rip),%rdi
call   1030 <puts@plt>
lea    0xf27(%rip),%rdi
call   1030 <puts@plt>
lea    0xfd8(%rip),%rbx
mov    %rbx,%rdi
call   1030 <puts@plt>
lea    0xf51(%rip),%rdi
call   1030 <puts@plt>
lea    0xf4e(%rip),%rdi
call   1030 <puts@plt>
lea    0xf66(%rip),%rdi
call   1030 <puts@plt>
mov    %rbx,%rdi
call   1030 <puts@plt>
lea    0xfc9(%rip),%rdi
call   1030 <puts@plt>
lea    0xfe2(%rip),%rdi
call   1030 <puts@plt>
lea    0x101d(%rip),%rdi
call   1030 <puts@plt>
lea    0x1059(%rip),%rdi
call   1030 <puts@plt>
lea    0x1073(%rip),%rdi
call   1030 <puts@plt>
lea    0x1081(%rip),%rdi
call   1030 <puts@plt>
lea    0x1096(%rip),%rdi
call   1030 <puts@plt>
lea    0x10ab(%rip),%rdi
call   1030 <puts@plt>
lea    0x10ab(%rip),%rdi
call   1030 <puts@plt>
lea    0x10c7(%rip),%rdi
call   1030 <puts@plt>
lea    0x10d5(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e3(%rip),%rdi
call   1030 <puts@plt>
lea    0x10e4(%rip),%rdi
call   1030 <puts@plt>
lea    0x1111(%rip),%rdi
call   1030 <puts@plt>
lea    0x1148(%rip),%rdi
call   1030 <puts@plt>
lea    0x1180(%rip),%rdi
call   1030 <puts@plt>
lea    0x1198(%rip),%rdi
call   1030 <puts@plt>
lea    0x1195(%rip),%rdi
call   1030 <puts@plt>
lea    0x11d5(%rip),%rdi
call   1030 <puts@plt>
lea    0x11dd(%rip),%rdi
call   1030 <puts@plt>
lea    0x121b(%rip),%rdi
call   1030 <puts@plt>
lea    0x1259(%rip),%rdi
call   1030 <puts@plt>
lea    0x1268(%rip),%rdi
call   1030 <puts@plt>
lea    0x12ab(%rip),%rdi
call   1030 <puts@plt>
lea    0x12b6(%rip),%rdi
call   1030 <puts@plt>
lea    0x12f5(%rip),%rdi
call   1030 <puts@plt>
lea    0x1319(%rip),%rdi
call   1030 <puts@plt>
lea    0x135c(%rip),%rdi
call   1030 <puts@plt>
lea    0x137c(%rip),%rdi
call   1030 <puts@plt>
lea    0x13b9(%rip),%rdi
call   1030 <puts@plt>
lea    0x13f8(%rip),%rdi
call   1030 <puts@plt>
lea    0x1413(%rip),%rdi
call   1030 <puts@plt>
xor    %edi,%edi
call   1040 <exit@plt>

LLVM IR (-O0):
@.str = [63 x i8] c"Usage: getnodes <grid file> [-i <node type>] [-o <node type>]\0A\00"
@.str.1 = [47 x i8] c" [-m <mask file>] [-v] [-x|-y]\0A\00"
@.str.2 = [8 x i8] c"Where:\0A\00"
@.str.3 = [70 x i8] c" <grid file> -- text file with node coordinates (see remarks below)\0A\00"
@.str.4 = [45 x i8] c" (use \22stdin\22 or \22-\22 for standard input)\0A\00"
@.str.5 = [10 x i8] c"Options:\0A\00"
@.str.6 = [37 x i8] c" -i <node type> -- input node type\0A\00"
@.str.7 = [76 x i8] c" -m <mask file> -- text file with nce1 x nce2 lines containing \220\22 or \221\22\0A\00"
@.str.8 = [38 x i8] c" -o <node type> -- output node type\0A\00"
@.str.9 = [72 x i8] c" -p -- tweak a bi- or tri- polar grid to a representation that can be\0A\00"
@.str.10 = [73 x i8] c" mapped (xy <-> ij) by using gridmap structure (node coordinates\0A\00"
@.str.11 = [39 x i8] c" are assumed to be in degrees)\0A\00"
@.str.12 = [27 x i8] c" -v -- verbose / version\0A\00"
@.str.13 = [34 x i8] c" -x -- print X coordinates only\0A\00"
@.str.14 = [34 x i8] c" -y -- print Y coordinates only\0A\00"
@.str.15 = [13 x i8] c"Node types:\0A\00"
@.str.16 = [41 x i8] c" DD -- double density nodes (default) \0A\00"
@.str.17 = [27 x i8] c" CE -- cell center nodes\0A\00"
@.str.18 = [27 x i8] c" CO -- cell corner nodes\0A\00"
@.str.19 = [14 x i8] c"Description:\0A\00"
@.str.20 = [58 x i8] c" `getnodes' (i) reads input grid nodes in \22X Y\22 format;\0A\00"
@.str.21 = [68 x i8] c" (ii) validates them (sets node values for empty cells to NaNs);\0A\00"
@.str.22 = [69 x i8] c" (iii) if necessary, converts the nodes to a specified node type;\0A\00"
@.str.23 = [37 x i8] c" (iv) prints the requested nodes.\0A\00"
@.str.24 = [10 x i8] c"Remarks:\0A\00"
@.str.25 = [77 x i8] c" 1. The grid file must contain header describing the node array dimension:\0A\00"
@.str.26 = [21 x i8] c" ## <nx> x <ny>\0A\00"
@.str.27 = [75 x i8] c" where for double density nodes nx = nce1 * 2 + 1, ny = nce2 * 2 + 1;\0A\00"
@.str.28 = [75 x i8] c" for corner nodes nx = nce1 + 1, ny = nce2 + 1; and for center nodes\0A\00"
@.str.29 = [28 x i8] c" nx = nce1, ny = nce2.\0A\00"
@.str.30 = [80 x i8] c" 2. After the header, the grid file must contain (nx * ny) lines with X and Y\0A\00"
@.str.31 = [24 x i8] c" node coordinates.\0A\00"
@.str.32 = [76 x i8] c" 3. An empty or commented line in the input grid file as well as NaNs for\0A\00"
@.str.33 = [49 x i8] c" node coordinates indicate an invalid node.\0A\00"
@.str.34 = [80 x i8] c" 4. An optional mask file is a file with nce1 x nce2 lines containing \221\22 for\0A\00"
@.str.35 = [45 x i8] c" valid cells and \220\22 for invalid cells.\0A\00"
@.str.36 = [74 x i8] c" 5. A grid cell is valid if all four corner nodes are valid (not NaNs).\0A\00"
@.str.37 = [76 x i8] c" If a cell mask was specified, then a valid corner node must also have\0A\00"
@.str.38 = [40 x i8] c" at least one valid neigbour cell.\0A\00"
@.str.39 = [73 x i8] c" 6. The grid (union of all valid grid cells) must be simply connected.\0A\00"
define void @info() {
%1 = call i32 @printf(i8* getelementptr inbounds ([63 x i8], [63 x i8]* @.str, i64 0, i64 0))
%2 = call i32 @printf(i8* getelementptr inbounds ([47 x i8], [47 x i8]* @.str.1, i64 0, i64 0))
%3 = call i32 @printf(i8* getelementptr inbounds ([8 x i8], [8 x i8]* @.str.2, i64 0, i64 0))
%4 = call i32 @printf(i8* getelementptr inbounds ([70 x i8], [70 x i8]* @.str.3, i64 0, i64 0))
%5 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.4, i64 0, i64 0))
%6 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.5, i64 0, i64 0))
%7 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.6, i64 0, i64 0))
%8 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.7, i64 0, i64 0))
%9 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.4, i64 0, i64 0))
%10 = call i32 @printf(i8* getelementptr inbounds ([38 x i8], [38 x i8]* @.str.8, i64 0, i64 0))
%11 = call i32 @printf(i8* getelementptr inbounds ([72 x i8], [72 x i8]* @.str.9, i64 0, i64 0))
%12 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.10, i64 0, i64 0))
%13 = call i32 @printf(i8* getelementptr inbounds ([39 x i8], [39 x i8]* @.str.11, i64 0, i64 0))
%14 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.12, i64 0, i64 0))
%15 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.13, i64 0, i64 0))
%16 = call i32 @printf(i8* getelementptr inbounds ([34 x i8], [34 x i8]* @.str.14, i64 0, i64 0))
%17 = call i32 @printf(i8* getelementptr inbounds ([13 x i8], [13 x i8]* @.str.15, i64 0, i64 0))
%18 = call i32 @printf(i8* getelementptr inbounds ([41 x i8], [41 x i8]* @.str.16, i64 0, i64 0))
%19 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.17, i64 0, i64 0))
%20 = call i32 @printf(i8* getelementptr inbounds ([27 x i8], [27 x i8]* @.str.18, i64 0, i64 0))
%21 = call i32 @printf(i8* getelementptr inbounds ([14 x i8], [14 x i8]* @.str.19, i64 0, i64 0))
%22 = call i32 @printf(i8* getelementptr inbounds ([58 x i8], [58 x i8]* @.str.20, i64 0, i64 0))
%23 = call i32 @printf(i8* getelementptr inbounds ([68 x i8], [68 x i8]* @.str.21, i64 0, i64 0))
%24 = call i32 @printf(i8* getelementptr inbounds ([69 x i8], [69 x i8]* @.str.22, i64 0, i64 0))
%25 = call i32 @printf(i8* getelementptr inbounds ([37 x i8], [37 x i8]* @.str.23, i64 0, i64 0))
%26 = call i32 @printf(i8* getelementptr inbounds ([10 x i8], [10 x i8]* @.str.24, i64 0, i64 0))
%27 = call i32 @printf(i8* getelementptr inbounds ([77 x i8], [77 x i8]* @.str.25, i64 0, i64 0))
%28 = call i32 @printf(i8* getelementptr inbounds ([21 x i8], [21 x i8]* @.str.26, i64 0, i64 0))
%29 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.27, i64 0, i64 0))
%30 = call i32 @printf(i8* getelementptr inbounds ([75 x i8], [75 x i8]* @.str.28, i64 0, i64 0))
%31 = call i32 @printf(i8* getelementptr inbounds ([28 x i8], [28 x i8]* @.str.29, i64 0, i64 0))
%32 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.30, i64 0, i64 0))
%33 = call i32 @printf(i8* getelementptr inbounds ([24 x i8], [24 x i8]* @.str.31, i64 0, i64 0))
%34 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.32, i64 0, i64 0))
%35 = call i32 @printf(i8* getelementptr inbounds ([49 x i8], [49 x i8]* @.str.33, i64 0, i64 0))
%36 = call i32 @printf(i8* getelementptr inbounds ([80 x i8], [80 x i8]* @.str.34, i64 0, i64 0))
%37 = call i32 @printf(i8* getelementptr inbounds ([45 x i8], [45 x i8]* @.str.35, i64 0, i64 0))
%38 = call i32 @printf(i8* getelementptr inbounds ([74 x i8], [74 x i8]* @.str.36, i64 0, i64 0))
%39 = call i32 @printf(i8* getelementptr inbounds ([76 x i8], [76 x i8]* @.str.37, i64 0, i64 0))
%40 = call i32 @printf(i8* getelementptr inbounds ([40 x i8], [40 x i8]* @.str.38, i64 0, i64 0))
%41 = call i32 @printf(i8* getelementptr inbounds ([73 x i8], [73 x i8]* @.str.39, i64 0, i64 0))
%42 = call i32 @exit(i32 0)
unreachable
}

LLVM IR (-O2):
@str = [62 x i8] c"Usage: getnodes <grid file> [-i <node type>] [-o <node type>]\00"
@str.40 = [46 x i8] c" [-m <mask file>] [-v] [-x|-y]\00"
@str.41 = [7 x i8] c"Where:\00"
@str.42 = [69 x i8] c" <grid file> -- text file with node coordinates (see remarks below)\00"
@str.44 = [9 x i8] c"Options:\00"
@str.45 = [36 x i8] c" -i <node type> -- input node type\00"
@str.46 = [75 x i8] c" -m <mask file> -- text file with nce1 x nce2 lines containing \220\22 or \221\22\00"
@str.47 = [44 x i8] c" (use \22stdin\22 or \22-\22 for standard input)\00"
@str.48 = [37 x i8] c" -o <node type> -- output node type\00"
@str.49 = [71 x i8] c" -p -- tweak a bi- or tri- polar grid to a representation that can be\00"
@str.50 = [72 x i8] c" mapped (xy <-> ij) by using gridmap structure (node coordinates\00"
@str.51 = [38 x i8] c" are assumed to be in degrees)\00"
@str.52 = [26 x i8] c" -v -- verbose / version\00"
@str.53 = [33 x i8] c" -x -- print X coordinates only\00"
@str.54 = [33 x i8] c" -y -- print Y coordinates only\00"
@str.55 = [12 x i8] c"Node types:\00"
@str.56 = [40 x i8] c" DD -- double density nodes (default) \00"
@str.57 = [26 x i8] c" CE -- cell center nodes\00"
@str.58 = [26 x i8] c" CO -- cell corner nodes\00"
@str.59 = [13 x i8] c"Description:\00"
@str.60 = [57 x i8] c" `getnodes' (i) reads input grid nodes in \22X Y\22 format;\00"
@str.61 = [67 x i8] c" (ii) validates them (sets node values for empty cells to NaNs);\00"
@str.62 = [68 x i8] c" (iii) if necessary, converts the nodes to a specified node type;\00"
@str.63 = [36 x i8] c" (iv) prints the requested nodes.\00"
@str.64 = [9 x i8] c"Remarks:\00"
@str.65 = [76 x i8] c" 1. The grid file must contain header describing the node array dimension:\00"
@str.66 = [20 x i8] c" ## <nx> x <ny>\00"
@str.67 = [74 x i8] c" where for double density nodes nx = nce1 * 2 + 1, ny = nce2 * 2 + 1;\00"
@str.68 = [74 x i8] c" for corner nodes nx = nce1 + 1, ny = nce2 + 1; and for center nodes\00"
@str.69 = [27 x i8] c" nx = nce1, ny = nce2.\00"
@str.70 = [79 x i8] c" 2. After the header, the grid file must contain (nx * ny) lines with X and Y\00"
@str.71 = [23 x i8] c" node coordinates.\00"
@str.72 = [75 x i8] c" 3. An empty or commented line in the input grid file as well as NaNs for\00"
@str.73 = [48 x i8] c" node coordinates indicate an invalid node.\00"
@str.74 = [79 x i8] c" 4. An optional mask file is a file with nce1 x nce2 lines containing \221\22 for\00"
@str.75 = [44 x i8] c" valid cells and \220\22 for invalid cells.\00"
@str.76 = [73 x i8] c" 5. A grid cell is valid if all four corner nodes are valid (not NaNs).\00"
@str.77 = [75 x i8] c" If a cell mask was specified, then a valid corner node must also have\00"
@str.78 = [39 x i8] c" at least one valid neigbour cell.\00"
@str.79 = [72 x i8] c" 6. The grid (union of all valid grid cells) must be simply connected.\00"
define void @info() {
%1 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([62 x i8], [62 x i8]* @str, i64 0, i64 0))
%2 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([46 x i8], [46 x i8]* @str.40, i64 0, i64 0))
%3 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([7 x i8], [7 x i8]* @str.41, i64 0, i64 0))
%4 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([69 x i8], [69 x i8]* @str.42, i64 0, i64 0))
%5 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.47, i64 0, i64 0))
%6 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.44, i64 0, i64 0))
%7 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.45, i64 0, i64 0))
%8 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.46, i64 0, i64 0))
%9 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.47, i64 0, i64 0))
%10 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([37 x i8], [37 x i8]* @str.48, i64 0, i64 0))
%11 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([71 x i8], [71 x i8]* @str.49, i64 0, i64 0))
%12 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.50, i64 0, i64 0))
%13 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([38 x i8], [38 x i8]* @str.51, i64 0, i64 0))
%14 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.52, i64 0, i64 0))
%15 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.53, i64 0, i64 0))
%16 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([33 x i8], [33 x i8]* @str.54, i64 0, i64 0))
%17 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([12 x i8], [12 x i8]* @str.55, i64 0, i64 0))
%18 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([40 x i8], [40 x i8]* @str.56, i64 0, i64 0))
%19 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.57, i64 0, i64 0))
%20 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([26 x i8], [26 x i8]* @str.58, i64 0, i64 0))
%21 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([13 x i8], [13 x i8]* @str.59, i64 0, i64 0))
%22 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([57 x i8], [57 x i8]* @str.60, i64 0, i64 0))
%23 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([67 x i8], [67 x i8]* @str.61, i64 0, i64 0))
%24 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([68 x i8], [68 x i8]* @str.62, i64 0, i64 0))
%25 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([36 x i8], [36 x i8]* @str.63, i64 0, i64 0))
%26 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([9 x i8], [9 x i8]* @str.64, i64 0, i64 0))
%27 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([76 x i8], [76 x i8]* @str.65, i64 0, i64 0))
%28 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([20 x i8], [20 x i8]* @str.66, i64 0, i64 0))
%29 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.67, i64 0, i64 0))
%30 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([74 x i8], [74 x i8]* @str.68, i64 0, i64 0))
%31 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([27 x i8], [27 x i8]* @str.69, i64 0, i64 0))
%32 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.70, i64 0, i64 0))
%33 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([23 x i8], [23 x i8]* @str.71, i64 0, i64 0))
%34 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.72, i64 0, i64 0))
%35 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([48 x i8], [48 x i8]* @str.73, i64 0, i64 0))
%36 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([79 x i8], [79 x i8]* @str.74, i64 0, i64 0))
%37 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([44 x i8], [44 x i8]* @str.75, i64 0, i64 0))
%38 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([73 x i8], [73 x i8]* @str.76, i64 0, i64 0))
%39 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([75 x i8], [75 x i8]* @str.77, i64 0, i64 0))
%40 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([39 x i8], [39 x i8]* @str.78, i64 0, i64 0))
%41 = tail call i32 @puts(i8* dereferenceable(1) getelementptr inbounds ([72 x i8], [72 x i8]* @str.79, i64 0, i64 0))
%42 = tail call i32 @exit(i32 0)
unreachable
}