ELF>,@A@8 @@@@ 000 <LLxp<LL888PPDDStd888PPPtd888,,QtdRtd<LLhh/lib64/ld-linux-x86-64.so.2@GNUGNUzaYe0snGNU  7?UV %Db>/j f(F?5sq[) "v"__cxa_finalize__libc_start_mainstderr__fprintf_chkstdoutfputs__stack_chk_failstdinfwritestrrchrstrcmpexit__ctype_b_locungetc__printf_chkputc_ITM_deregisterTMCloneTable__gmon_start___ITM_registerTMCloneTablegcry_mpi_lshiftgcry_mpi_newgcry_mpi_powmgcry_mpi_modgcry_mpi_mulmgcry_mpi_subgcry_prime_checkgcry_mpi_aprintgcry_mpi_rshiftgcry_mpi_gcdgcry_controlgcry_mpi_get_nbitsgcry_mpi_mulgcry_mpi_releasegcry_mpi_set_uigcry_mpi_scangcry_check_versiongcry_mpi_invmgcry_mpi_divgcry_mpi_copygcry_mpi_setgcry_mpi_addgcry_freegcry_mpi_add_uigpg_strerrorlibgcrypt.so.20libgpg-error.so.0libc.so.6GPG_ERROR_1.0GLIBC_2.3GLIBC_2.3.4GLIBC_2.4GLIBC_2.2.5GLIBC_2.34GCRYPT_1.6\  xn`ii ti ii ui Lf^L-L`-PPNNNNNNNNN N N N N NOOOO O(O0O8O@OHOPOXO`OhOpOxOOO O!O"O#O$O%O&O'O(O)O*O+O,O-O.HHA/HtHAWAVAUATUSHH $H8dH%(H$(1HAH/HD$H.Ht HHD$Al$HAD$L%~L-L5D$HL;A?-uA-uAAfDLLD.LL0.LL.tH5L.t4t5H.HL$HH81e.J.fu[H=-H1%1.11&.|$tyH-5H01-1-1Hs?-0HH=U.-HJ1%1-1&1-H0.1-HH Aǃtp-L%3HL5UL-!HUIcB A݃OIcL> ǃt u Aǃu1=s-~H<,HH9-T-H$(dH+%( H81[]A\A]A^A_H,LCHHL$H81,H,H=M HZ,f. AǃCHUIcBL-,+DIu+fD$ 0x ǃAHUHcDBAwRB|4 E~q ǃMc1)+HT$H5 H1]+1+ A ǃvoH HD$1*HL$L IHt+HH812++Iu*AwBD4 Hc+=jLcJ<E11L,HT$ H|$*Ht$L)H|$[*$+? Aǃ7H*H= Hm*_ ǃ-dHUHDB}߃AlH7)H0)*PHcHH This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Syntax: mpicalc [options] Simple interactive big integer RPN calculator Options: --version print version information --print-config print the Libgcrypt config --disable-hwf NAME disable feature NAME %s: unknown hardware feature `%s' - option ignored usage: %s [options] (--help for help) %s: Libgcrypt is too old (need %s, have %s) + add [0] := [1] + [0] {-1} - subtract [0] := [1] - [0] {-1} * multiply [0] := [1] * [0] {-1} / divide [0] := [1] / [0] {-1} % modulo [0] := [1] % [0] {-1} < left shift [0] := [0] << 1 {0} > right shift [0] := [0] >> 1 {0} ++ increment [0] := [0]++ {0} -- decrement [0] := [0]-- {0} m multiply mod [0] := [2] * [1] mod [0] {-2} ^ power mod [0] := [2] ^ [1] mod [0] {-2} I inverse mod [0] := [1]^-1 mod [0] {-1} G gcd [0] := gcd([1],[0]) {-1} i remove item [0] := [1] {-1} d dup item [-1] := [0] {+1} r reverse [0] := [1], [1] := [0] {0} b # of bits [0] := nbits([0]) {0} P prime check [0] := is_prime([0])?1:0 {0} c clear stack p print top item f print the stack # ignore until end of line ? print this help f=pHw"t;(LD\xzRx &D4D d H (P qAHD s AAF P| FBB B(A0A8G I  8C0A(B BBBA -`-L\n .LLoX    oo oo oLPGCC: (GNU) 11.2.0.shstrtab.interp.note.gnu.property.note.gnu.build-id.note.ABI-tag.gnu.hash.dynsym.dynstr.gnu.version.gnu.version_r.rela.dyn.init.text.fini.rodata.eh_frame_hdr.eh_frame.init_array.fini_array.dynamic.got.data.bss.comment 88P&$9 GoQ hYXXao ^no }   .. 0088,99L<L<L<xNx>P@ P@ 0@"@