???
123123123123
.....................................................................................................................................???
123123123123
.....................................................................................................................................
Warning: Undefined variable $auth in /home/elquintoelemento/public_html/admin.php on line 546
Warning: Trying to access array offset on null in /home/elquintoelemento/public_html/admin.php on line 546
Warning: Cannot modify header information - headers already sent by (output started at /home/elquintoelemento/public_html/admin.php:1) in /home/elquintoelemento/public_html/admin.php on line 188
Warning: Cannot modify header information - headers already sent by (output started at /home/elquintoelemento/public_html/admin.php:1) in /home/elquintoelemento/public_html/admin.php on line 189
ELF >
@ p7 @ 8 @ 8- 8- 8- P- P- P- 8 8 8 $ $ x x x Std x x x Ptd T T Qtd Rtd 8- 8- 8- GNU E-ZY8E N @ A |CEqX 1 , F " R c B 02 (2 (2 v __gmon_start__ _ITM_deregisterTMCloneTable _ITM_registerTMCloneTable __cxa_finalize libcrypto.so.1.1 libpthread.so.0 libc.so.6 PySequence_Size PySequence_GetItem PyObject_RichCompareBool PyList_Type _PyObject_CallMethodId_SizeT _Py_NoneStruct PyList_Insert _Py_Dealloc _PyArg_ParseTupleAndKeywords_SizeT PyExc_ValueError PyErr_SetString __stack_chk_fail PyLong_FromSsize_t PyInit__bisect PyModule_Create2 _edata __bss_start _end GLIBC_2.4 GLIBC_2.2.5 v ii
ui 8- @- H- H- 0 f 0 0 @ 0 S (0 80 @ @0 y H0 X0 `0 & h0
x0 0 0 0 0 1 (1 01 81 `1 h1 p1 x1 1 1 1 1 1 2 2 2 2 / / / / / / / h/ p/ x/ / /
/ /
/ / / / / HH# HtH 52# %3# h h h h h h h h q h a h Q h
A h 1 %m" D %e" D %]" D %U" D %M" D %E" D %=" D %5" D %-" D %%" D % " D %" D HA H
" H5g H919 Hn! f AWHHAVAUATUSHHdH%( HD$81HD$ HD$H. H# LwL E1Lt$0L|$(LIH M9}TK,,LHHHH 1LHH+ IM9M H|$0LD$(H5! H9wtb1LHg H5" QHtTH(H H HL$8dH3 %( HH[]A\A]A^A_ @ LeyLLy1H߉D$ D$ @HD$H
" P1HT$(RH LL$8LD$@ZYtLd$ Ll$L|$(Lt$0MxIH
H5j H912T @ AWHHAVAUATUSHHdH%( HD$81HD$ HD$HU HJ LwL LLt$0L|$(IH tkMIff. @ K ,LHHHH 1HLHm LcM9|M H|$0LD$(H5 H9w 1LH] H5 GHtvH(H H HL$8dH3 %( HH[]A\A]A^A_f. L9~I# HD$ D$ ALLy1HD$H
P1HT$(RH LL$8LD$@ZYtH\$ Ld$L|$(Lt$0HItL9IL;IHy1 7 AWHHAVAUATUSHHdH%( HD$81HD$ HD$H H LwL E1Lt$0L|$(LIH M9}R @ K ,LHH~HH 1HLHm t^ uDLcM9|M LHL$8dH3 %( HH[]A\A]A^A_ L9~Is HD$ 4D$ HD$H
P1HT$(RH" LL$8LD$@SZYt>Ld$ Ll$L|$(Lt$0MxIH
F H5 H91> AWHHAVAUATUSHHdH%( HD$81HD$ HD$Hu H HD$H
P1HT$(RHm LL$8LD$@ZY Ld$ Ll$L|$(Lt$0M I M9}DK,,LHHHH 1LHH+twxou>IM9Mx`LHL$8dH3 %( u~HH[]A\A]A^A_f. LeLwL E1Lt$0L|$(L=IHW1H߉D$ QD$ tH
H5 H9r1rf D H= H H9tH Ht H= H5 H)HHH?HHtH] Htf D =} u+UH=: Ht H= 9dU ] w H= [ HH OO|nn:insort_left lo must be non-negative nO OO|nn:insort_right OO|nn:bisect_right OO|nn:bisect_left _bisect a x lo hi insert insort_left(a, x[, lo[, hi]])
Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the left of the leftmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
bisect_left(a, x[, lo[, hi]]) -> index
Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e < x, and all e in
a[i:] have e >= x. So if x already appears in the list, i points just
before the leftmost x already there.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
insort_right(a, x[, lo[, hi]])
Insert item x in list a, and keep it sorted assuming a is sorted.
If x is already in a, insert it to the right of the rightmost x.
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
bisect_right(a, x[, lo[, hi]]) -> index
Return the index where to insert item x in list a, assuming a is sorted.
The return value i is such that all e in a[:i] have e <= x, and all e in
a[i:] have e > x. So if x already appears in the list, i points just
beyond the rightmost x already there
Optional args lo (default 0) and hi (default len(a)) bound the
slice of a to be searched.
Bisection algorithms.
This module provides support for maintaining a list in sorted order without
having to sort the list after each insertion. For long lists of items with
expensive comparison operations, this can be an improvement over the more
common approach.
;P 4l 4 H t zR x $ FJ w ?:*3$" D h \ \ P FHB B(A0A8D
8A0A(B BBBE ~HWA $ zR x ,
\ FHB B(A0A8D3
8A0A(B BBBK EHWA !* X l P FHB B(A0A8D
8A0A(B BBBH oHWAX FHB B(A0A8DHWA
8A0A(B BBBK $ GNU H- U f v
8- @- o `
P/
o o o o o # P- 0 @ P ` p f @ S @ y &
0 GA$3a1 _bisect.cpython-38-x86_64-linux-gnu.so-3.8.17-2.module_el8.9.0+3633+e453b53a.x86_64.debug 7zXZ ִF ! t/X] ?Eh=ڊ2NK F\ة!3; zA"<zmKl vgbp͇F==p!1֝Q rn3O7.(NQجT2e ,3^RubB[ ǿHv"*`0Ģ?^ͬᮠ*)OKX z h y]yeFz
2Xka^sřZļ=u!=ݣ\
dil[ə]QQK CmcIw
Mv" j5;-.ĪVM_n7
/R6b/)%t̵tB=''d'A0L.Idv 4Y2X Vhs6
y3ZmBđÚ, 7'?\ip`U o.^|ps`WsCű
O//A[5Hp("7! h,r|.1Z kUJys -
6l]\QZi8<- C/(SӔ9λ+'5n$(seFWdg*y ?uJg#u\Iy,YwLy}W<5H@]6DٽHg3%\ΜLN9PeO`t$pe>H!c'?hEv `omqω;p*SdX _c^_Ѽ)bZ(](UӽIَ>ȗ
pYs6ѱ0C 6 t:g YZ .shstrtab .note.gnu.build-id .gnu.hash .dynsym .dynstr .gnu.version .gnu.version_r .rela.dyn .rela.plt .init .plt.sec .text .fini .rodata .eh_frame_hdr .eh_frame .note.gnu.property .init_array .fini_array .data.rel.ro .dynamic .got .data .bss .gnu.build.attributes .gnu_debuglink .gnu_debugdata 8 8 $ o ` ` 4 ( ( 0 8 o . E o 0 T ^ B
h c n w
U }
T @ @ 8 x x 8- 8- @- @- H- H- P- P- P/ P/ 0 0 ( (2 (2 02` (2 $
L2 ` 2 D6 (