WKs8*A)1GG&Q2b13?ݒ0C*_K?
b=?Y2UJ3	)P2v)mMF#g]f÷/t	4 j¶Fǂ_ek3y6nYT.BCD.
J|q;kaIB*g^ۂsд7b"!6i[OH<: $Z\n%֜!8w?z<fEeUYItyl'?E'YrA uN
y{k6ߞAeڪ*pS~jnk(KϹk[ˀX.6Xݰ*dlUED>eYQלK.\ʢ
Ml(k4$2OJLl9TA_i~~ڷP⽵jCq\[]mqK	s.0 f"˟*{Vݭ5a5M߲T`nrORV,܅^Ϡ;"XmXnuo!cɄ8.m:E^/YP%l9v!Myyd
	'^0Fӑ^B᪺+ǜ9u.ip
gzE3FЎ1i-N܄_JeZR@TAzFa aCA5ukj$іd¢` 5AP9ksgW1SM|OCc^ss]Qw8fd-vKz-ա1\4+^g!9"yZuX94c8`JhzRh8
QX@J	
WS\mPhAHY\VSU/НG{*Y=qʫ;$D@`]M9x&ZK;"Rp_8J_8\+/<U'Q愂;5,\hG^K+}ǠÀK?2yL^?7Naw:hКj*kL5oТS0xE21a5ѦҠk`W~JsrƂx2U2)aB#:ڵlhñ$8'1u(ի,eХ^zEű*Ue3?+:QgB8#2m'I}]}4<Bš","j/bL^ Eˇܴt^)c܂8	7.
  Mo6jQM Rho$5Z%Vwh2GKK3CRsEaȹYR\_0e3qdOsHHd5$+IVCm1JDMiO|.`h	F7 p	_Lb=OBف o/<ڦ@L	@`¸	y~,q #R~3Z	LeB(B8N*SͧO֢e\ZLqGqGq#8Ǧ`aw6wJ\ApkGAx<5 igqZmOtȏ+,gm1Yfv^COBOc?
^ˋED!&]DeOVsa7&.Emw`hf[d oȚfil"@ugR`
<TRȏO%j0rkٯ&u(3t8NwsuygiuĬ~"ذ4ccY[(C._S3zWRܫʱ{^iWzwĉfg2|y]LXBiq:hJ}T<!lAL#k[Mplr><mb5&ogS~wqlX(o`.gVT3=f1~p\BE$ZvD4<[JnrAO4%!(Jz7bʢO%硚]խF
{=YDW4f媼Vi
|kߓN 'OPyVT}O誾h4^zp*}OKLZ3V^kx~1x)20zIxS]-WN+|i7i'j^VfZg{ :SH ;u˗/w®jwL/	JTխp$v匋71kFQzx+
}  WKs8bϙ1h<6YNvUMfvKlrrH׭~wyRl7hO:%4y&Ҹ<tŌ<rBsoY|{d*KAFR90ڱ5?k-99&mAǩ97ܡ[.ѹGKAe=c>F' h^Oa:.cc|Z -;u`BQVY6MmP6]r躣7~"y
[ɢI]]Ct86zOԚxrB]7H	UU"ƪ47nt84$d^㑗2^
˂vO-O^)'Yz.Hp*e߽$o*V,׮EQ7Q*k#xX`Tۨdq7]Sb
tks+7dns@|GI&7!x1E,fFPߴY$*it̲S;%؀jr+r݀Bu6oj#[wKScV@\=&t?X4yh%tGNE>[Ռ
тl$)4R-E.Bo4><䂿xXeyu,wLMΰNGOc@X 69/f
By0ȒRAw< y^Wyİ--6:ʎ-xtjxdQ?N1LJgyQ6Y}In ˶zw)M6YsACVE<{PT9,ktXO2&S"ЍƸ9j/YhbWCÂ.4ĵv%zrJ[wZ[$Ty7CĴ'Fq{Xk3I0%Ebs1 %deJB!2ێ(TuAg˹rm)E}%r~P2g0EJlk0LZbJl#"#yTWb3}[#Yx&sz)yTw %0ғOjP9{W
^Aă`0~ lڢ$
}̄ٽx +cxS"ńu(WMS26L5f9
0e29oPρiGƊHb2eTM*ldR2ʟU7,)ǰ=swxN:t]8hE:oМk6$.-\ʌjAM4`0XG	Ez
Kuxa
c:1Fid൦aeVȰ  WKoHGheanIMD{lN6뷪)*U]?\JB82ø)>ws}*T,yd^f9gH,:lr:{Umʶ)cTEM.rAgkݖWeF n<gzmQ78S?LPTy{ W*51+sr_6'/MˤWr
}*9į2 ]*	p#	]ⲠLVTP?~?9sDYTEY ][pLӽ AȘc@JhʁZy6 1]*n'gilʃw暹	0Hw	X?_#/.g47󆒫$ɻyInɪu`H!	&Nb3IGpw-pgu ty)Ilj'.lk@dY8Gз&rfML|b $97gf<iC~CnkXFo@7~41栁QGp#%^~|IAئr((:(iΏFP6^gy
s҂XfR=yE4؈lUh:=pllGX`3A頞8s,Y9n;_5(b'rV#<Zh@IyމmY0}APF۫:;T+Rj+ZB^t"k'by3 1!5JDN {r5ڂ%۲+k3<[:\LaTWb|36wزˉ<n°.Jv=:d4
,0Z5lW
gpy}76)lE1f`KFmaqW45!wlE N6
~V1Q)cnXэ`% ^J%z)?`)aA~5\Q {,;9kF#lC 8%	
~ʥi/щ$B rd'D7 ݣ$VO+aTт,! 7e	Ԣ`
5ll01pʦg9}A Z`D̗dA_fWj6(h:ӥ/P"Y3VTSsf; *zHɕrqS	%%g1JR=IjA{0s|" 2
ʲ&!{< d+䚄;ȩ$qS|({__   Wr8ݧ*#0XLbwpL3]Y
!l1tlmoR
GWݗ,Xŏ_Y<>ٕ=۽s<FH]?b5,	h#9gݐ|-@'d#~WvQU|N**Vlr?)ޱ=uhuiVd
C;F|DIREgNo?S.e#hL~OszpO~VL2zor*XQ%\(,U\R7BN0ՉFj"Xf5
[+
|E0{Qlj~::@e
YVZPqDUN95/'Y<-7KwɇzMܨ	}keMbCQ9#<7x=rT1{uR,@&[U4r{5P)vF+HGڂYǭd+_]dqC]2
P[ICVY>*l4kMsDTlTh(kUUVh3b2
	d""«kp&V1lVӊ87CQ 5[)jS;xC/qCZڗK;a
/vH
8\hMi~ulG_^VrѦ?nU(I7!EQC^$!v۔_^tu<-Cos2?ˇф@Gc0%a9d0 BY0sr{N~!9ڲ,HS6̕U "|cUY6,G	7rCY5BDbX ISؔ-N\cLj~s0HF.wdoos|NBv錶mE,ϚtP:^[$4j*0й_077r
Ԉi!'5yA&ko1@*mkMaäALL/	uUs jBX0݂9CMEx	Xъ<QiBT])m];E]%XLƺC7`"u@
jo0*
vEkTJ=`/PNr͐ס+wc:i
YR6Pvd`]\n@FkƬs&եqO?!˼C`8(di,0<z   WMs8*A=))06Gĵv$ٛ嘊)ɿn!־$T?_wnaZ]*Ӓ<t	wV%	',0OlshAGܦ/Eɋwlя2wߠSq[^lC==	2秴!boiB~bϲM~>@<#g^lyؘT~fTi(iPvAިSz2L#w=gWAQ sgS,	$%YWpۭl)ozR e;<K7w"f0{
#:FVn">ׁܳ'!+=+rvjA|O=<Y#:;~JE¤5sAT%?qAF(#:Jez=Ϟ yM_ +'y}#R6ڤr>(U+|B4OmcؠP--dqH5詀cГb|6]-Ϙ܇yX{.2^|$TIp@%ڮ#"iZ]oR\8h}ImGa:ckol "@vE,/yA=KW+k~Fd<tce< 6D]~M&yLpJzufDXq"ۦ8\Z=o1)sA{
Z)`5"	P!5]8b閠&k{8Ќmʒ:Y 描?wUhF}\+8rׇ `g08G]m`a لP
1Ϗ(`iݩgW0[*?L{iVBDN6Զvr!v(ָj1:i+'MK?Ax#]9A.ƳxoDG!x} ڏUekEO=LpBƑ.	r7XTYn gF1|#m
_uT3%mu:ؕ6Ťm)%m~h~)e,iAwҦ9ӑ6iuMժM=÷/mj+eM?A6MKcٖ6wҦcC8^;~ViG;t\;8awJF`%piV6/.]  Wr:ݧ*]τ;TlOfـ<8`WŌp
}JO{?>X660tz|x|xr}%%Bk$մhP#PH+4w
4׀>hcC׼
1Ȉ;NoǫC<Y?uU8Faxzy뜑@ӴTPmݘd17oϣZ)(|6@M|R8zF;
Y @*% >P$G}tO(+n@1
 `x]Q?K*=߽I{'?'n zkJ@tB#o$SjAhzLw(OZ͈%*?|bVBL:o?ԹZs&0֝;kwڡXvdN˪8G"aLÁfqlpzȦ{yY'ee˸HsqkK'36ʁ)NB<7f-8P- kSo4P@$+(iQ~
(T)ťn)lr?ˬA-wbPYlnra,e4j}3LPmY8t+}N`6;ocqsШ=#i=PYXmoVya*no6Y"_P>Ҙ)F+"xlL4/.HpQdUV0Oi&RW9
9\+5"/.8Xp-wCiRòic	m#:gR&aJ=$QFǑPs0~hhSݫ鴐%S/`ŋpv6:ޠ(/(ѰM2lT$5$Wu(5ww1!|XQ"PYu2I/Uz'%52Ǭ3У*nˉ9:^8Չ]\oϜYAی}&+2lsC6],	,~`-]gJ^關r%|\	9
Yƭ
XB#9M1p]._<d͞+yd'FkO(4\U0*L>,B[4W		gMVp"솔m<ÐmK,y|P_  WK8#쐐
jh&JHFlt:V*~zz=><>f'wE͊rƓT5>n)KސO4GɊFLF-Ǉ?l]NpǦPF]h]fEuD+ ~@^_{n8+[EْTe9;r I
wZV5!CF0.0z5t"4;݀ 6ČX&fI21#EL2GLkYL̂}1P&fIF
1Ĉvd(#-b=bX˱nI2x{dK-
4%UӆNCc%e3Q
"#ːQe7vuYoZLвLkj*ozz}[YUVevEQ,";^U"R q9.Oƣl/5N
|hwW=.yz䙃-Ct@P.ZNø>Grt"k+O
<Нg?P6Qޣ?PPP
mhRRrVl6g
0?;SH7<"3@B>r[8*/"J(#<$"1t ^huUTp*vZ⢈tdZc8Y7@Zfc7AgJ,)7ZIC].Vp#ꃅ^Obyoum]7ϛ= >ݸе6h9+&k2M?B*<3h_+:N,K@* in%L !4ƭLTi5b20'gln辬rqM֝!2~ 2zȒb  i'M֏)#lbx bO/<-s&"(ۥx l #ʈge.n;ONsz~zo?>sUƽƌȚ*Bx\HG?
+bB8j7z	>X/
gwV/0*!+&[)O   WMSHSb9lA$[ @Yfx%a_y4ms]^civ_.!X\Du3qQI89	6tRaϹS>k(V':|1,Dx "͊qY:QЈ
I_2M }]-0{~х@2
Rtyi}6ecu K1lǬn\uٟ^1x_ym0wSr
KUAQes̋Iq<I|^n[\_AUy.|-]C2{}ɜd,-X&Oi2k{-idՈY]u-H/J+lW4$G)fSGeG9	dl|ˆ=!?QqiT !DzWzS!cꁩ}SzOT\ֻź!6-2*Rԧzb%f%Kk{Y[Vş	qSVJ/:8R\bXhx\7z.q)(j0K:8v-8`ؤm2_Q6Ou|EsJ@ԁ%RDGxgcY78u.	'o RXQDm#^X$&L!;3`ʐ㺜`R[5FO7(`6c18t$Od1+kUQ`!K5b̓E!&QXCVM<۽ڭJ!y˚2dc18yzrE>Li[7_Io ]8B8,B8٩n6cv,KZ5S&՗Dq'4];\"çuY
&<~۸m'vdSagukn
+AmbZm[L6g#cچ'fȏզ IG
!D9Ve}z!o[rHMWq\;5]ېcď=D\9V_"{wWWkzrY
\.e14u{Ob
n{xZc$g6
 5nzKFBJ   VKs8*A=!%юsmٛ$DSgo0>S'<KTJ2}"XJf	hdD"iixP2;ӲgD
+SG4SYD	ة8{<P
Ǳke%ݙGߜV9kYZh
 Xug(ƽcS{O'S{/1װxq[>eF,(393HG^{x<eYep 	̷|*[$*0H_Xvs,9d{QH	;7VYS+AUp` ,x>,7~x6
btFo`½X@ŹrLEnDqlt|d=+
-L:J\7fDtVSvz
yE;Mmea5K9Ғd+g)qZFQ4e]yTX'j?p{:+V~@zhc-[d8ۚ$"uLciUk.K|$KC>cUL3OR,A@T|;Sv<2Ȣ1D]i
ίn~EupꟵ*^X.TeK}#D`d::n''t<*t^R4#'
ٛٽU_Kg
ywnKWoT4F;UD\=o*]ǂHCbY7WD`)$Z^35|̪71e,{~ƾ랼TӰ}wj+#E]^43MciZHp~XJ-A8zD{dJG/,ЩoXzGm6QYl2sqטZB>0nh/i&0~'NOXIA[ј}Տi^&'Zʘ`;GBg{9݌s'l6Ω?]wE`xhGy>}_hQJ%w].T:p?fckQ6
e/k{LYS	;tPZ<VEH'#1+TYۗtֱoa17^Ђbu=ÞH/RPQ݋W_^è  [s63I/v~clPa;Y^#>$+ؖUS.jzߕ@4N9Yր
Gr`x}u}u3@&KI@GQh[֭ST
0=	g	tpKZ~@Ņ:Iqܾyq`oߠYth'ϴ+95lӓAǴ$MN]h޵`֩hW4s,L'\P2]%G,qCKV&pU
f,ģiF@&!%vpcH5Gf8H@`HV2ńBChj[-=f]W)m#kMOTI=bߒv<CiMYqVY+mY\	aR[B|~Qu=q5:Ҕq5I]#۷9#KoHN7阘pÄ&)z#oXb
w4Q1Tu!q}Dp}ï/?o:^q'B\T@|8@GGQ?F:B#HtFV/]Xf=Io;3q%) وFNhc[aF(=mBE_݅owP%Ehe_iyXݞL.Kt+Y>ΟhJ(]ג\ʅ#\=Ix=bL{;Rx)|{w3*@^cl26T̜e:k8>Ac
~Q <%[[l<BqzjHs]cIzjŜT}XԩL̷E0iqx}~jk<z׿eԅaF}Pz3NsBH僣D`
yJX0`ʹN㵖:LGAڬ;*,i!NmbcœPCO<3]mVQ噟AvÃ˘AÎhF/Z
,)/*%cFJ
jwT{vNEkKՑʓ`,_ݴ̹e_d"O~]LղKp2@ӢܘuNT]   VrJݻ,HH1C«$W4ت:#nxaN93}NK:?w{s{s7E;̇UgwĆFJnclui״")y״<ek98NKUO6k_|4oΣ5Cڻ_RmeM]Oy^sMx׶leَmYsZ֤me-2MvӟwSv|>!x@{4+$,,nd@b'>Roy0@|m]ʱzk5cQvQG\TG#_}aX-m/DL}Xsя2|Auca*8,ߞiMkT1HTjmnlO|̆8jC)
JnAg8`gu \
pYغJHz]7S*-&2*iڷR߲|OI1p']&yJpRV(qrP:eغȥ+҈wl݉dEa͋#%k˂AnJo<hxnÄq,r]GZ§]sMy5g^50{tmj(MN;~O]ɧ~U~G5#zIShY0ǩ_n4`6>mܨ~
_[8x2Af
L+~nb
Q}eӺ`~I܄
_s6Xن<6l
H6
;\p<~6X}mCx`
?|6mBLƀA t)osx\RÑ>:]:dʼ:(7ߒRDء69UmdׄrCchC;~eb^)z4:TxZ<NI%ӡQۜD%AxݦAe+AŁF  n0DDȪ %.L&n`(d$&B"ߗ%R^ˇ^YFY
뫛ov/Z=8&{|7n6WIř7!!ܚ"CVZ1@N.8P@+P_=R3TOЩ5h~%q_
	lhC/H#ciB#C
ȷxKv9K$_T׺;%Q3؉+85E<$C2m7E85E489UHp3ew-p$P]"2)ĀgQBBW d
9/)L
F!	I <|EbCbGdSra +!<H1C8C3DӇ!xf?q+Ew!
bxTAc'Cpz gO	aS#JG
Kq?ʗi4d1$ߴUjsIA_Fta+@f4CI*sSiFʪX(
I&k*l\TV|r^DEU>6gX@F5Қ<,s*rcEƵ*DAh
FbGFF;؈gm/MaDgWؘNgyJRmi>K}K}6ҵz9*|5وlޚck|۳Khd
ViwԇT]W1w)x;}nOFlhM٩p֝v%kޔFxn>.ʠ&}V(]
8yEWLk7mPGwkdu\\_O1)ufRk{  VMs8*A=iRl>'v=
Ǫ(8m!%+{ZRxIѺC|q
6I
nonoHю#sE
cJZc_yBeti
bפFϔdT޶i}@~5,sboGZԐDA~#L#6L5PG5PWu4POu%.S7^^(HԘ(XC$
vFi*2?QGUĴU	Ny:<#2~^)*EGW%r]'VrwTnYIj]U)\h| /]1U=kG}Y|ey2U<臶-X?W|Ba1w62-Oi_cO;h3#=IѢVŞh^RR3^-gE_0L R4X|7װ\[D!̠>Q7zp'ѿeR?gl-hĢ]0o=Q++X<y6f3zxwz~y)JfH]1!NDaXO !E:3a/Oc2FFVPTj
`ѲciC;K%e4C!*%@#o#cDфX$3^B?Q6#?FO~_*3ZP78[(q!W
~%As-$dm$PkV\x6,Z3:ԚC{8?-J-6<]tpvu&|\zQX!AbSv:{Qc9xzEZ<<*p&"5&bjYS /_(Zm"d#D2lfbAIഇٝ,ݱ?.ԟ&C;ٹ#;2KFvNT쳂W9dt>5j6K[ǩ:4e	PTvY9,lꢸ`GW.vr0M3ny2	)h
:Q ?&l_   WMsH*A=l4ة1ƅ&{l0qf2~Me3[sǧP^K!{IdDKVigEPaZ\^\^h"OO=-@o .{!^МCǈ(BF)oaօ~Eu|`񸺛0]:OK=d122M鷎*\^ܰ,Fw6w\g:2LޙdӪrѴZ^'nWáQe4L8i
nȜHl[FD%4_e3S}/2Fage0,FZK-e^NxoFwT+iw2HbTM(bwc[
\<գ>
لLiKTůQu]rKZ{x'9QZ
i${Xpw(+DPyHR]Q<!Vʈ!oZțyӦ,7ezcǥܻ#0hg}u8=?ps'N+4YƊ׏(QiH5mFur%1KdċQ>^bש}ݼ ^~umRSpQV틬1\-Q5CAY+f
GClOvPnxҧTC+CD +TaKϨ0-zx
澳̉}/
--hU5	ӍN6L7~qnuj?n^b	p)| M܇hslvswH2<	5kR=pŮҼq%>L="NA&Zrܩ>nf.-o/Y8]cTl{EQ%5o@;	1WW_ɿd
QxfI~Km2ć.Q1C\⺋o6]
wWjs 9Mw,%_~Yk-VjjkӊhL>_=~5gٿQB(?i?+WY
#Z,~
lD:-9^yl'<[;./ID1tTyo9R';`Ϝ/MhE,T˸N7twK]mE')5=  WK0GCOݤMBU՛	FE&U߱
eYn<͌{g>-3V`/?8{Esᭋc#ݖW޲B4զ2d>6U
|E2@m~12q*0|y┩Hĥܛyq ܭL,M(ؑ`21|vaȳ3$JR4tf[ϴxRUlʓXg0bCmDʖxԒCj0	)[{Xxј_*gl~
_Bz0<1v=FH8
 Ud,N	錥>e	Pw6T];a袊}LTsO,:Ua:RkNe)NYㅳ";Зsv*r(ժ[n_ewltνDN	_CC9i
h;f'?Q0UsN	,~a/v<#{XHƕD)t0 P @&bƛjԀ<+`28]ϗ&Ɛް/M*Դu H{VgF#k4vij=L[SjFmK*PZ5GꊏF?^ýjC(cb0Yٮ	C+~ `P^w<ն{p
S ĠRCD9nMr$$ޔ@gm'$zeiCeGX0s!Y2g.w5h ﳿ	v9؍0(,~RT0'w$~Ih*IձxLK2WXu{՜CGyBGٸ  WKs8*=l)?0#*&f
I6GalS%B2x8>~.sKaxL:'ɟҜӄ?ð%~)S4O`i`r-j[Ͼ<9?7"ާ-y++sp(<˫:X4B/&	w$Xpqear\3k+[@hRǴisyA(<;WiV|ΒR%i
Jj o)Lq{aU׌}cHbVxE{ߊBT(PA[]Õ7%#vohhbL
Ghzj1j#[;">Uj!2*{EۦI~p741>2ٍ{
ښ=gX=3~k:Y`^He>hxVM]Qe-uhh'CzcNھXy+D4g;ѻ.E,iX.XWO9
0\ӲbnAv"jnOS/"G[Ed.Rf_KvlDzViQ86"hs	fjPSl"[6;{"61Z٦vgq 9u?5DTҦu^^mfQm8K˪X~CqƋ)ņ#rOmf.Wxix9	F
ZR<gV0>­xx ڢ8bLt-CEZ°m
xx-XDY"^C]n#ޚΦ-cv]7
oTt6a>uG&pYcKOjԐ6k)L.z&.:jkOX];P9cKm_B{0	cOa9<pub+GƎ6y(C2bi\Wꮄlȱ)%+ʊV*H8o_\jŧr֒fK`H+L^,)^EUiEb #ZQeY
V{rur76\?   WKs8*A=!1~l`ORFX)ɿߖxdvPSkYL6L
1ۛۛm̲'BP
lB[XWlYAhb'ØMׇy\6M4dyx´yZ>5	CN3mv
R.jNmSY<cE>i݇,<jmGe{"ҭ>M޵|Yfۛ?yg`Fu<ز
3Y7A`zGt\8ib<B^D"[`eşđ=1Cs88E<NK++O%L:LpSpx<` h)PF̲qs
$
UyC15'i:K5٠ZiB2E A cx+215nnhݗ37,;"`clivmq-+u2u2+uJK	9(Ϝv[	a(a'\/Ĺ_^ɘcm
2 
j
E01kJACY\]C,yOjupvRN ĸ#_$8
<JܨiR iR0XAQ'^*tbKkX6b$+.EC_s"^<Uk+hMXf3V,?ة%6u:Wwk"U/ЈᚖGϠ*{䃴|u!aN_XEvph=o XQX*/`vYN=pUu۰TtP*}Lqa?EKb`l'9d[I>9EIHHӴ_5MYUJ WN_Ȏ1aqF%^q؈Vq$=k&8\m£cAk9{l_l fo끛´%p=y"pN8Z
P_&a˦LƯQQ
QD9*/:vL!u5WGҹv+jXؐ/z|$Æa,q<CuҔ8>1|QzA[䗨GqL%<$Q'Á67<*BP~! b9>OEA݅<{&A3{TH'$HyN]L^<mCwlF%H@L)T?G7   MsHb[$&ְ8Yhd"KN_/}
1{_?}4EȻ'\I%E+ti.v/vLX
=cLЗKTƃԦ陪)֜B>ɬn󂠕βPbtLϯgtw_+`1 +_PՏ|ǵcV7["ּNV=wy]-"WNΟhF9,h#@(7'Kӥei^J
f^j9-.-M^*V8'wN,*w]L ȉ rNe'80#p\w-MPshM\9%hw.q4NnT[8)Uq<zǕ{>к.ڗm Ú1	aʈ|}N]bqE+cvr)6E*NgIɱ]>֯Kdi^[Be4NKyɚK] H赲	ZÐ!e$1 iqL[uN6[ǝլV9͟&^Ӭk|Nnҍ}:WZg{&
:чXC턍ۈKQhmfT[5&mߡs&ゖ4Jz)6K>3Uut{ WH
BPUǲ:UeUP9@)CKQX55SQ3"-hdPK!}7;6TQD1j_x7زKJ2HrMhb&g/bhiuٝ-k}DP^uͲFg\`RBs[
?߈r0ڴvgbۙ.V	_(Iq{54m˱Ҝ4Kꨱ<Cf:z{18t{&[p9A-`]Mw+ -yM  oH#X^zʭkG~BdH[b/1-7KXbQ%B"|<ߝ_\_]_l4&s}oQ̋^MO!G$
բٗ?X7SZQՀ	A.JyԵS6 4~Ϫ}aI};<+lXfX${-lzj_Kb
bcYݳ[8Xb[
ˊ|q
BTHi3UA9\6}USy6G]TܿnVyVa?,2Ij9,MbЅ[$ktmiy$)g4E2Y˚XYCU^j"WGIewqwGsM1cn+$l4lvWBt$6
ReOQnℛk6Ļ6nj6+v9wH@fjjHR]e_lEdw`b]54 <.qM]DɋՋ|MAnM't[ avƙ#L$V~kz>z$9ڏ=L-kF$$]p{*{Dqd\35Ǒl&JhKMT5jkԒNǘBaxM +	UB&ϛdڔ21!L:p󕪻ݖmtzdնB\B8grsp|Ɲjyw(ƕ=$mDf}atr*`7
G+BvN<D%~@LndwԐ;iI "X$uwG+br	zY`,@C8G_2Y7J5/׷Y/ǏqKv2
ك
Ã`/㥦<[IOWM>)͡`>⺿7pF~.G0o}}.(p[鋝~KE
b	7q2ג
X䛼~RuBˀf%r2Tk7eU`iH&ĉ{|vlE:t¾Z_e{\=|   WKsFaB.[B9څXK8,4$ߧ9-*1_=<<(^'S4]?ϳ-<q7~>+y7 N3=Wcשׁ
/\i-^%9Y==s^7/"z	NзxXB6J6Mw01<C(2%cMP44{ ^cmF [l, d̒`3)ڔ%ǩ[.6 /
hUã,y]dm4c aYq$Y]T^"Ppxx9S>/T"%1AGP|XI7ETf{Ugoƹd:FRaL,='B#7XS&L2):7pD.A37^h
b %<6Ʒ7iE(.'<"y`yeSs>*vu< [<༠eOuaz\^i3$@̒aUZ[2Ŭ-@;	'H"y(!J̥<FlNgϯq<qW֩AJ^BDEkUTd(~ 8qQ?5Y}(\-l'_bI'K@[B]BǙWbUErALSZ
vņ PoxkϠ@3yF6`{f}֞YFO^I9fUx3z)
ud|ܔ?,&s'G+F(xj$t娆lp%`ǶMx9N6akJFTF}F&-RŹ
$|{2_a>He$J5q/A+^{t6[#5"äɁ-tmAw}gG9)JbzQgw8슝)GN)j:ZptaGG
Lj?6 j$P+GjBSSidqm}kC_GbQ"g/gh{gbyi`Js?JXV9SAD?=Usv:U]Y5Rj"]ѷqNK|i/1Sc~if(IgǤXNAR  Wˎ8ݗT`eղYIP%]ݽ3tP%Pʣ?6$]j"ҕε}kvE8iy@mr>nZ|ڲ>"?Gէ:'xbIY41#f03i:VJ6uq!Z"="<&
jP}C6,
s/ro1"0S nQZsnš&J4mY*=O~.c/BB},em ޣpS	)0 *ӁOb;qԁp0$N.04f
"ep`aE"4
fZc^v"cRװf
L$SI4þI3ȿ
M2R|>e]_̋ ƅ9$<Nu.d;LYقyz9"-HJM#3aVJIeЇR?`; PUOd<=5
1)@Qc_f}(=@@㞝Ld6ŉcsKlP@Z>FA}=~iA}
j;P2ڀ@f(e^;-QܨKbUZ8cHsk@v(TN#FJ[smsiz,
r	ނu:f&Dc%$W)OsZ1qQA?pqޭXfT|$%mIdk^$xp<ǽҨtI7Yuer"Cכd86mߗj)|Hj1Itz
n7luvGǇ~B'W,׽ԴpdZBiV?d' II۠[<fCt}qۧޯ	5
o&<̮iEĳC:}Wxkn+EЛwaKYMPX>U4ʀ
5nْ]tA_y ک^V|h/^0a^XԟeY=E}  WMo8 t=e 4q IcQ֨%-+to/)=Tf7nFE^dx`Y~kAá4XB31יWXoD+OeQP$SN)i 45 L7:&-v,G}#qK\w,JZ$i\X	^BpeXƤB`A ($&e%NJf"lNa*((|/Q*c-;Yy7@G| fP8qSvfLcCQ& uŉ_OQTb[O[40,?mDC*,%~ДTa+xRwuee1C0iřìJ4%%'7m+c?*CjZL@C saPB4+?r!yѡBJ!0HprsLM\DE\9DH&Auw>^#GG30Ui3GY,MpJ؉Ф?WpFtJ@)5BS)owC@Pׁ.=8ZlMS8]~:E˳_biͲUMܟSMXt,3yZihGŰ=1@?x:		#G!<%y5Ѩ:eC/1[uc~(3hTv#dQװ#Bj$%f/H$ϗaˋ)rG0T=1sM)p8*L	?dWO"HT75┩&	2yKW(X>XS.Ca)>?$=rfPbYT.υȋBwEa1fRLm&]oҤBLENXydu4oqeZ|3=uN.-I秥 #5駢m\CJho74G1i)5 LSEVCy!|=\OįO1hGA_z`"#-&~V`3֠BLd0<3٬hA5~#\ {׎,3d[.Ҳ]R1Dc2r_4 e#ط
1~v^ a8q.>̬a	:ht91e ƸR q2<na|%F1`Slz   WKHwD
J+1ЙcQZ1`Fو=UV族̟LB(9!t\doƷ`EtD_DǇ?WY0]/jƳ$,,Cx465 D+i1|aȀhrs|8GQ3GCC\y:D(vi84qIu.gO)Z6^B(*%Cww=`g<k*v
.;62?}c'xI##4Qbez`ǓL O=fRZM*cH\9Xq.s*bU5_l',@,.qBKs:`Ʊ-B]lrT\XT`}\:,+zAx]e@\#h2E{5nυݙy
&WVQ/gM}@
cX(SHk@䟄7m32=qcw)f4yE\Da0إ2_a߭0[V
3O0F(*$+pr.
, I;Cheq7DaHjc,'86udV@0>"fB1mpdP߲RUO	Ua-؛('Scl_MQ sA3	
azgp&\Dx5;1Hj,ęÑJ[%Ynj]3!
Cwf-M2K&HnjࡔE
ݣS60߭:d",y.ZP	P
4D$060TULc͗=>sxz
y
Z.S6lwޤ+ ?Ña(qXvvlbcPC]!+{"hLt`rjlyW.lSSX'H}\CzƵael*g_)|BI3SZߠ=Sci%E >zR	
EzD!9VJanX`,w`9
e]qqcѨq*"y$%ƥb!yH>x_b(y*+vCYm+:a9庝P||\:^͏je0)of40JAI=QY16bX\ ('(  Wn6?Wlˉ q%ꆸdHJrӯztqdL|831n<5Cky(*#w7L0eeY&~Yûh#~ !u<LPa<9nFkzzꪃ86랄/ZSxZ2?G,r=Obs%8Y_+Y90ZEFgKr4<lَ%Ŀt5͎wHS/d21\ƀiq<T:ܟB<.VXȋ>;pvZB.q$(D}㦱@f H(N10C
X%E}Np-L0U06 NfGuk祿mxִsgE"l;aNa>7hoyearI Ha.LۑL)δ(D,RM_eISYM4Mم[ñ23HYOT:IJe]eV?/+ohc~?&Ǝ+/*?ABV>z^&GăC*CBn
 3vja\N?@uK)L;ړ俜JO^-7v
MYpjV'ej4W}F"$͗uSoB EQ%ndbX
2Y&+R4/Z͝+s8fq)}>tX)Ś"e*:mvCm޾Uy®nKpvs;bng3?*	9t8;!`^ۯ>OKXbY% d5 
Ĳ(ȠLS]Cb}^Pc L᪰#F'E#+/7 KjŖjQT}N%ΗYL褵puXV6F
rYQ~F5+,ZBv[yC`Kli--`MT,xM+;QϿ   Aw6~y顧MlͱIl'.uۛ"3CO`V}!	񟙟fF}~f7i5no[1X/0g?
ì}8nuV[^0,űeW+[fHRRV{TNTnx4jdIwLD/?R0繾cK<%}XWd
fVjbQQJǏG,&F
fuB))"
>ZfMUhNJHA#Ԛ`Y5^ RPY|b'w֠~b;x]l+H0psNwd]uuHcDm͒}(f(EGb{=pZ\X&;	YljpA&	V"S~6)x,'oYǫ읁G=\/aI'[^_;MNI5%OI^(FXy7q.	dI@k^cHThD<
YDyư{d^&HX3;*ko]SN	${N޳N	5)k$=O* \}
bމ\E\6w>־nks"L`@lOQ`LȇR9DuNTD
i$-PXyQ&"R%4sUDE5,I
h0l9 ]i1<&0S5ll~);Ex\E_3ڡVPLa(*Qʈ¤
#0rDC;#
 (ayܕ*e]O,IB3s{^'L	?kl܎G[򡊐92Ql{;ךcG|.
]}ؾ;gF]m7K/}.v7Y8-83b}+Xh}Ț1"955'a$B0etu8ݮWǖkg)~df9CݘxWGy~UVMX.9sl^TJ򊗢#,^ևj^\FELpuo}Rk+kjqx{Z-nmH^&Xr&ΈFN5b[SuƷOau>6Q9u׃1uՎG   Sn0#+zi I[A%I"MPߵ Sm]3ƚ
1iwEU(vbFk8s Ė;N-&"9݈1yt;"a١L2SJYF!d]l^5e(8M`I^ؖ:DCA7բ`y~I.(tZ<4inBdB3IbtK	Bn2ŸJ]]~Fz<ݫN>.@ss:5oinlt`ȺqDVHdT_͍QrIEUE抷N0W&q8=(Q~~/Xf
u?\16   00c8778ff08

"Start W/ Baretta In Chest"
d00c867c0010
800c8772ff02

"Start W/ Bazooka In Chest"
d00c867c0010
800c877aff07

"Start W/ Colt In Chest"
d00c867c0010
800c877eff05

"Start W/ F.Bazooka In Chest"
d00c867c0010
800c8776ff09

"Start W/ F.Thower In Chest"
d00c867c0010
800c877cff06

"Start W/ R.Launcher In Chest"
d00c867c0010
800c8774ff0a

"Start W/ Shotgun In Chest"
d00c867c0010
800c8782ff03

" Restores Health"
d00cf8440010
800c51ac00c8

"L2 +  For Shotgun"
d00cf8440011
800c8784ff03

"L2 + O For Barretta"
d00cf8440021
800c8784ff04

"L2 + X For Colt Python"
d00cf8440041
800c8784ff05

"L2 +  For Flame Thrower"
d00cf8440081
800c8784ff06

"L1 +  For Bazooka"
d00cf8440014
800c8784ff07

"L1 + O For Acid Bazooka"
d00cf8440024
800c8784ff08

"L1 + X For Flame Bazooka"
d00cf8440044
800c8784ff09

"L1 +  For Rocket Launcher"
d00cf8440084
800c8784ff0a


.end
#----------------------------------------------------------------------------

"RESIDENT EVIL 2 (CLAIRE)"
"L1+L2 Health Restore"
d00c623c0005
800c7c4200c8

"L1+ For Grenade Launcher"
d00c623c0014
800cc930ff09

"L1+X For Grenade Launcher (F)"
d00c623c0044
800cc930ff0a

"L1+ For Grenade Launcher (A)"
d00c623c0084
800cc930ff0b

"L2+ For Bowgun"
d00c623c0011
800cc930ff0c

"L2+ For Spark Shot"
d00c623c0081
800cc930ff0e

"R2+ For Submachine Gun"
d00c623c0012
800cc930ff0f

"R2+X For Rocket Launcher"
d00c623c0042
800cc930ff11

"R2+ For Gatling Gun"
d00c623c0082
800cc930ff12




.end
#----------------------------------------------------------------------------

"RESIDENT EVIL 2 (LEON)"
"Infinite Health"
800c7e7a00c8


"L1+L2 Health Restore"
d00c646c0005
800c7e7a00c8

"L1+ For Magnum"
d00c646c0014
800ccb68ff05

"L1+X For Custom Magnum"
d00c646c0044
800ccb68ff06

"L1+ For Shotgun"
d00c646c0084
800ccb68ff07

"L2+ For Custom Shotgun"
d00c646c0011
800ccb68ff08

"L2+ For Sumachine Gun"
d00c646c0081
800ccb68ff0f

"R2+ For Flamethrower"
d00c646c0012
800ccb68+@  ! !    !" #  P#" b @ @ !$ 0%      0!" 0@ !%      0! !#  $  b!  !#  $      '  '诰  !  $  (! @ 4 D < @ C!@ D <$    0@<   |$    d  T  l  `  @ (@ (! ( (!  @  !    ! @ b!  @0! g! @ F!  G!   c F $  p X x   t   ' ' @!  
 t p  0 d $ C0!$ C+@ $b    Dx#  x! !m 0 dl   p  8 ,b! d+` $I 
P l n+T@  `p!$e ! !b  L N $bM K $    b G $$    b B $$ $ $ $     b .&#$ $     b (&#$ $     b "&#$ $     b &#$ $     b &#$ $     b &#$ $     b 
&#$ $     b  +T@$ &## *@ %& `8! *@  h !ML   $ @ Y!E  +@     %J@e ! l ! +T`  !   ' 'د  !      $&3 4 l d D# C#@ $`              !B        $ $ db! b+` * 0! 0    (! D < h  @ d ! Q# h d T Q# q# d T$   q+T@    q#  $$ (! 8 @ b !$   q+T@    q#  $$Q!   @ #@0! 0 d l (!    (! l b! l,c `      0 d P 0 C! d!B   L @c   C& D$ @ l,B@       B @           ' ('௰  !    4$C q+@  ! `! l,B @ 
         ! l@     @ B  !        d l  l C! d T d`  Q ! d+@      T d# l  d 0    E(!  (!  ! d T  8!    F0# d      T  B @ 8  ! d T $ e#$B b+`       (! 0 E(!  ! d T  8!    F0# d      T  B @  !        T   (! 0 E(!  !:B ,Q  d T 8!    F0# d      T  B @ $     @B $ $  `!     '  'د  !  !   !<    $T  <   $R   $ l,B@          ! l,b@     `	  !`      l,B @      @ P d 0  D!B  L b& d$ @ @ < , b! dq   8 D$ @ C!Q   @ < f @ C!D         d $ q#$B C+@ $  b   !    (! X X,B @      f j [ 8# @$ C!G  0  T!C    !$ $c !  b $$B b 0,C `  @ ! !B        R!B  !0, @  !B        R!B  !B	$B b	 l$B b&,f  X x `(!  # E+@ + l, @ ($ X d @ P 0$B   d E!B  L b& d$ @ @ < , b! dq   8 D$ @ C!Q   @ < f @ C!D   X$B@߮ X d$B     d d X P 0 C! d 0 d  X C! d!B   L @c   C& D$    @ 0 d d! @d   E!@   C!$c D  0    ! $B  $B b&,f  l d$B$c  l d     T   (! 0 E(!  ! d T  8!    F0# d      T  B @
  !        T   (! 0 E(!  !:b ,Q  d T 8!    F0# d      T  B @ $     @b $ $  `! $       ' ('Я  !   !   ! $ <   $$U  <   $R   ( l,B@          ! l,b@     K  !`     l,B @      @ P d 0  D!B  L b& d$ @ @ < , b! dq   8 D$ @ C!Q   @ < f @ C!D   X h X p  " \ x C+@      d $ q#$B C+@      S   !    (! X X, @ 
$  b 	$       d h C#,B@      X p,b @      X b+@      ^ f d	 l s$B  8# @$	@!% b!0  U!g  C    !$ $c !  b $$B b 0,C `  @ ! !B        R!B  !0, @  !B        R!B  !B	$B b	 p$B b&,f  ! l$c p$B  D# l d$E +@  d @ P 0  !B  L b& d$ @ @ < , b! ! D$q   8 @ C!Q   @ < f @ C!D   p$B@ݮ p d  ` X$B 2 d T   (! 0 E(!  ! d T  8!    F0# d      T  B         `@ 6$  d 0 d! @d E!@   C!$c D  0    ! $B  $Bb      T   (! 0 E(!  ! d T  8!    F0# d      T d$B  d l  $B lb @  !        ` d l$B $c d    l `@      d 0 d! @c D!@   D!$ C  0c  !b $B b   ` T   (! 0 E(!  !: ,Q  d T 8!    F0# d      T  B @ $     @ $ $  `! ( $       ' 0
`V ,      
bZ ,      
\x ,    
`  
b  
`  
b  
\$,    
\H,    
`6,     
`B,     
`R,     
bV,     
\\,  |
  
\d,    
\,    
\(,  `  
\8 
\t 
\,     
\ 
\,    
`V,  8   
\X,  0  
bf,  8   
\,  0  
`,  8   
b,  8   
\ 
\<,  `
  
`f,     
`,     
b,     
\,  `
  
\$,  H  
\<,  H  
\H,  H  
\d,  |  
\x,  
  
`,     
`,     
b,     
\,  `
  
`,  8   
b	,  8   
\T	,  
  
\l	 
\t	,  	  
\	 
\	 
\	,  |  
\	,  `
  
\ 
,  H  
\
,  H  
\
,  |  
\
,  t  
\,  
  
\,  
  
\,  |
  
\,  
  
\ 
\
 
\
 
\,
 
\ 
\ 
\ 
`,  8   
b,  8   
\x,    
\,    
\,    
\ 
\,  
  
\x,    
\,  8  
\,  $  
\  
\,  |  
\h 
\x,  |  
\,  8  
\ 
\,  |  
\,  8  
`: 
bB 
`F 
bN 
\d,    
\<,  t  
\,  $  
\,  T  
\,    
\T,    
\ 
\,  |  
\0,    
\d 
\t,  |  
\,    
` 
b 
` 
b 
\,    
\,  t  
\,  X  
\<,    
\d 
\t,  |  
\,    
\$ 
\4,  |  
\d,    
\,  8  
\ 
\,,  |  
\D,     
      deflate_copyright 
_dist_code
    deflateSetDictionary _tr_flush_block 
  read_buf  0  
deflateParams H  putShortMSB _tr_init |  
flush_pending t  
longest_match z_errmsg adler32    deflateCopy zcfree memcpy memset   fill_window _tr_stored_block 	_tr_align h  deflate_stored      deflateInit_  0  deflate    deflateReset _length_code P  deflate_fast zcalloc  |
  
deflateEnd   lm_init   deflate_slow  4   
deflateInit2_                                                                                                                                                                                                                                                           M  pE W  ֝@L O P L A Y E R  ހN F O  O N  ~$]Ü(
I C  >-p\-0tU Q X N  ֝@R E Q U E S T E D  ҠS L U G  ։W I N  CZ E  ԀJ  ֝PS 6 F I  N K P Q G 1 M 0  ֝PR J  N S C R N  ҈ L  @A U N C H E R  ֎`I B I D  S T B X  0O C A L G R O U P  ҠM  ׃%DE N U  X!Y P R O P  0N 2 2 Z H  N A M E  ҠO 8  ֝@C C E R  ֋L E  0S Y S T E M  ֌0U R C E S I D  ҠP  բǚ3 0  v91 1  4 1  ֋05 0 1 E V  D L  E R F  0G F R  0P L U G  ֋R I N T E R  GO 2 0 0  @Q 1 8  ֝@K  ֝PR  ʸS 5  ֝@R  N 7 1 G H  Ԅ
L  ԄA D I O  0C  ҠI D   X  ֝@S  %X 5@7 T 5  ֝@C  ԭ`E R V E R  ҠP I N  0S T  m V P  ֝@Y S  ̴Z U  ֝@T  %C@}v nP 8 P D T   A T  0
U S  ҠE C H N O T E S  @G I F 1 2  `I M E R  0J 5  ֝@N  O P N M  pR E C  ҉S  ҉R H E A D E R S  $%M 0 1  0P A S S W O R D  $%S E R V E R  $%U R L  $%
S E R N A M E  $%
V A L U E  0X T B X  0Z D  ֝@U   ϲFi1 5 S  Ԅ2 5 M  Ԅ7 B 1 S  Ԅ
I B S  Ԅ
K 1 M  ԄS  ԄI H  ֝PK 0  ֝@S  ֝@V A L U E  ̀W  ԧF S   X  澴@
Cde@q?0@!.[Y
J/}Ǜ7z`vDk D  N?<֦P1  Sp 6  K 9  2 I C E L   A R   
2   C  `A R D  ՍsbD L G  ֢O D E S  ֡E G   M U L A T O R  Ll G E T I N T E R L A C E  ҁ I M G T S  S O  L O A D  @@T E X T U R E  ҁ   # 1 "C:/N64/TEST/PNG/trees.c"
 




 

























 

 

# 1 "C:/N64/TEST/PNG/deflate.h" 1
 




 




 




# 1 "C:/N64/TEST/PNG/zutil.h" 1
 




 




 




# 1 "C:/N64/TEST/PNG/zlib.h" 1
 
































# 1 "C:/N64/TEST/PNG/zconf.h" 1
 




 




 



# 49 "C:/N64/TEST/PNG/zconf.h"










 

























 




 





 








 








 












                         









 





# 151 "C:/N64/TEST/PNG/zconf.h"








 
# 185 "C:/N64/TEST/PNG/zconf.h"

























typedef unsigned char  Byte;   

typedef unsigned int   uInt;   
typedef unsigned long  uLong;  





   typedef Byte    Bytef;

typedef char    charf;
typedef int     intf;
typedef uInt    uIntf;
typedef uLong   uLongf;


   typedef void   *voidpf;
   typedef void     *voidp;



















 
# 273 "C:/N64/TEST/PNG/zconf.h"



# 34 "C:/N64/TEST/PNG/zlib.h" 2








 




















typedef voidpf (*alloc_func)  (voidpf opaque, uInt items, uInt size)  ;
typedef void   (*free_func)   (voidpf opaque, voidpf address)  ;

struct internal_state;

typedef struct z_stream_s {
    Bytef    *next_in;   
    uInt     avail_in;   
    uLong    total_in;   

    Bytef    *next_out;  
    uInt     avail_out;  
    uLong    total_out;  

    char     *msg;       
    struct internal_state   *state;  

    alloc_func zalloc;   
    free_func  zfree;    
    voidpf     opaque;   

    int     data_type;   
    uLong   adler;       
    uLong   reserved;    
} z_stream;

typedef z_stream   *z_streamp;

 































                         






 










 







 




 




 


 




 

                         

extern  const char *   zlibVersion  (void)  ;
 





 






















extern  int   deflate  (z_streamp strm, int flush)  ;
 












































































extern  int   deflateEnd  (z_streamp strm)  ;
 












 




















extern  int   inflate  (z_streamp strm, int flush)  ;
 



































































extern  int   inflateEnd  (z_streamp strm)  ;
 









                         

 



 










































                            
extern  int   deflateSetDictionary  (z_streamp strm,
                                             const Bytef *dictionary,
                                             uInt  dictLength)  ;
 
































extern  int   deflateCopy  (z_streamp dest,
                                    z_streamp source)  ;
 















extern  int   deflateReset  (z_streamp strm)  ;
 









extern  int   deflateParams  (z_streamp strm,
				      int level,
				      int strategy)  ;
 

















 






















extern  int   inflateSetDictionary  (z_streamp strm,
                                             const Bytef *dictionary,
                                             uInt  dictLength)  ;
 















extern  int   inflateSync  (z_streamp strm)  ;
 













extern  int   inflateReset  (z_streamp strm)  ;
 









                         

 







extern  int   compress  (Bytef *dest,   uLongf *destLen,
                                 const Bytef *source, uLong sourceLen)  ;
 












extern  int   compress2  (Bytef *dest,   uLongf *destLen,
                                  const Bytef *source, uLong sourceLen,
                                  int level)  ;
 











extern  int   uncompress  (Bytef *dest,   uLongf *destLen,
                                   const Bytef *source, uLong sourceLen)  ;
 
















typedef voidp gzFile;

extern  gzFile   gzopen   (const char *path, const char *mode)  ;
 














extern  gzFile   gzdopen   (int fd, const char *mode)  ;
 











extern  int   gzsetparams  (gzFile file, int level, int strategy)  ;
 






extern  int      gzread   (gzFile file, voidp buf, unsigned len)  ;
 






extern  int      gzwrite  (gzFile file, 
				   const voidp buf, unsigned len)  ;
 





extern  int     gzprintf  (gzFile file, const char *format, ...)  ;
 





extern  int   gzputs  (gzFile file, const char *s)  ;
 





extern  char *   gzgets  (gzFile file, char *buf, int len)  ;
 







extern  int      gzputc  (gzFile file, int c)  ;
 




extern  int      gzgetc  (gzFile file)  ;
 




extern  int      gzflush  (gzFile file, int flush)  ;
 








extern  long       gzseek  (gzFile file,
				      long  offset, int whence)  ;
 















extern  int      gzrewind  (gzFile file)  ;
 





extern  long       gztell  (gzFile file)  ;
 







extern  int   gzeof  (gzFile file)  ;
 




extern  int      gzclose  (gzFile file)  ;
 





extern  const char *   gzerror  (gzFile file, int *errnum)  ;
 







                         

 





extern  uLong   adler32  (uLong adler, const Bytef *buf, uInt len)  ;

 














extern  uLong   crc32    (uLong crc, const Bytef *buf, uInt len)  ;
 















                         

 


extern  int   deflateInit_  (z_streamp strm, int level,
                                     const char *version, int stream_size)  ;
extern  int   inflateInit_  (z_streamp strm,
                                     const char *version, int stream_size)  ;
extern  int   deflateInit2_  (z_streamp strm, int  level, int  method,
                                      int windowBits, int memLevel,
                                      int strategy, const char *version,
                                      int stream_size)  ;
extern  int   inflateInit2_  (z_streamp strm, int  windowBits,
                                      const char *version, int stream_size)  ;















extern  const char   *   zError            (int err)  ;
extern  int              inflateSyncPoint  (z_streamp z)  ;
extern  const uLongf *   get_crc_table     (void)  ;






# 16 "C:/N64/TEST/PNG/zutil.h" 2



 
 
 




 





 

typedef unsigned char  uch;
typedef uch   uchf;
typedef unsigned short ush;
typedef ush   ushf;
typedef unsigned long  ulg;

extern const char *z_errmsg[10];  
 





 

         




 






 




 



 



         

# 89 "C:/N64/TEST/PNG/zutil.h"
























# 122 "C:/N64/TEST/PNG/zutil.h"



















         









          





































 
# 200 "C:/N64/TEST/PNG/zutil.h"










typedef uLong (  *check_func)  (uLong check, const Bytef *buf,
				       uInt len)  ;
voidpf zcalloc  (voidpf opaque, unsigned items, unsigned size)  ;
void   zcfree   (voidpf opaque, voidpf ptr)  ;







# 16 "C:/N64/TEST/PNG/deflate.h" 2


 




 


 


 


 


 


 


 




 


 
typedef struct ct_data_s {
    union {
        ush  freq;        
        ush  code;        
    } fc;
    union {
        ush  dad;         
        ush  len;         
    } dl;
}   ct_data;






typedef struct static_tree_desc_s  static_tree_desc;

typedef struct tree_desc_s {
    ct_data *dyn_tree;            
    int     max_code;             
    static_tree_desc *stat_desc;  
}   tree_desc;

typedef ush Pos;
typedef Pos   Posf;
typedef unsigned IPos;

 



typedef struct internal_state {
    z_streamp strm;       
    int   status;         
    Bytef *pending_buf;   
    ulg   pending_buf_size;  
    Bytef *pending_out;   
    int   pending;        
    int   noheader;       
    Byte  data_type;      
    Byte  method;         
    int   last_flush;     

                 

    uInt  w_size;         
    uInt  w_bits;         
    uInt  w_mask;         

    Bytef *window;
     








    ulg window_size;
     



    Posf *prev;
     




    Posf *head;  

    uInt  ins_h;           
    uInt  hash_size;       
    uInt  hash_bits;       
    uInt  hash_mask;       

    uInt  hash_shift;
     





    long block_start;
     



    uInt match_length;            
    IPos prev_match;              
    int match_available;          
    uInt strstart;                
    uInt match_start;             
    uInt lookahead;               

    uInt prev_length;
     



    uInt max_chain_length;
     




    uInt max_lazy_match;
     




     




    int level;     
    int strategy;  

    uInt good_match;
     

    int nice_match;  

                 
     
    struct ct_data_s dyn_ltree[(2* (256 +1+ 29 ) +1) ];    
    struct ct_data_s dyn_dtree[2* 30 +1];  
    struct ct_data_s bl_tree[2* 19 +1];   

    struct tree_desc_s l_desc;                
    struct tree_desc_s d_desc;                
    struct tree_desc_s bl_desc;               

    ush bl_count[15 +1];
     

    int heap[2* (256 +1+ 29 ) +1];       
    int heap_len;                
    int heap_max;                
     



    uch depth[2* (256 +1+ 29 ) +1];
     


    uchf *l_buf;           

    uInt  lit_bufsize;
     


















    uInt last_lit;       

    ushf *d_buf;
     




    ulg opt_len;         
    ulg static_len;      
    uInt matches;        
    int last_eob_len;    






    ush bi_buf;
     


    int bi_valid;
     



}   deflate_state;

 






 




 



         
void _tr_init          (deflate_state *s)  ;
int  _tr_tally         (deflate_state *s, unsigned dist, unsigned lc)  ;
void _tr_flush_block   (deflate_state *s, charf *buf, ulg stored_len,
			  int eof)  ;
void _tr_align         (deflate_state *s)  ;
void _tr_stored_block  (deflate_state *s, charf *buf, ulg stored_len,
                          int eof)  ;



 





 





  extern const uch _length_code[];
  extern const uch _dist_code[];










# 312 "C:/N64/TEST/PNG/deflate.h"







# 36 "C:/N64/TEST/PNG/trees.c" 2






 




 


 


 


 


 

static  const int extra_lbits[29 ]  
   = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0};

static  const int extra_dbits[30 ]  
   = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};

static  const int extra_blbits[19 ] 
   = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7};

static  const uch bl_order[19 ]
   = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};
 




 



 





# 117 "C:/N64/TEST/PNG/trees.c"

# 1 "C:/N64/TEST/PNG/trees.h" 1
 

static  const ct_data static_ltree[(256 +1+ 29 ) +2] = {
{{ 12},{  8}}, {{140},{  8}}, {{ 76},{  8}}, {{204},{  8}}, {{ 44},{  8}},
{{172},{  8}}, {{108},{  8}}, {{236},{  8}}, {{ 28},{  8}}, {{156},{  8}},
{{ 92},{  8}}, {{220},{  8}}, {{ 60},{  8}}, {{188},{  8}}, {{124},{  8}},
{{252},{  8}}, {{  2},{  8}}, {{130},{  8}}, {{ 66},{  8}}, {{194},{  8}},
{{ 34},{  8}}, {{162},{  8}}, {{ 98},{  8}}, {{226},{  8}}, {{ 18},{  8}},
{{146},{  8}}, {{ 82},{  8}}, {{210},{  8}}, {{ 50},{  8}}, {{178},{  8}},
{{114},{  8}}, {{242},{  8}}, {{ 10},{  8}}, {{138},{  8}}, {{ 74},{  8}},
{{202},{  8}}, {{ 42},{  8}}, {{170},{  8}}, {{106},{  8}}, {{234},{  8}},
{{ 26},{  8}}, {{154},{  8}}, {{ 90},{  8}}, {{218},{  8}}, {{ 58},{  8}},
{{186},{  8}}, {{122},{  8}}, {{250},{  8}}, {{  6},{  8}}, {{134},{  8}},
{{ 70},{  8}}, {{198},{  8}}, {{ 38},{  8}}, {{166},{  8}}, {{102},{  8}},
{{230},{  8}}, {{ 22},{  8}}, {{150},{  8}}, {{ 86},{  8}}, {{214},{  8}},
{{ 54},{  8}}, {{182},{  8}}, {{118},{  8}}, {{246},{  8}}, {{ 14},{  8}},
{{142},{  8}}, {{ 78},{  8}}, {{206},{  8}}, {{ 46},{  8}}, {{174},{  8}},
{{110},{  8}}, {{238},{  8}}, {{ 30},{  8}}, {{158},{  8}}, {{ 94},{  8}},
{{222},{  8}}, {{ 62},{  8}}, {{190},{  8}}, {{126},{  8}}, {{254},{  8}},
{{  1},{  8}}, {{129},{  8}}, {{ 65},{  8}}, {{193},{  8}}, {{ 33},{  8}},
{{161},{  8}}, {{ 97},{  8}}, {{225},{  8}}, {{ 17},{  8}}, {{145},{  8}},
{{ 81},{  8}}, {{209},{  8}}, {{ 49},{  8}}, {{177},{  8}}, {{113},{  8}},
{{241},{  8}}, {{  9},{  8}}, {{137},{  8}}, {{ 73},{  8}}, {{201},{  8}},
{{ 41},{  8}}, {{169},{  8}}, {{105},{  8}}, {{233},{  8}}, {{ 25},{  8}},
{{153},{  8}}, {{ 89},{  8}}, {{217},{  8}}, {{ 57},{  8}}, {{185},{  8}},
{{121},{  8}}, {{249},{  8}}, {{  5},{  8}}, {{133},{  8}}, {{ 69},{  8}},
{{197},{  8}}, {{ 37},{  8}}, {{165},{  8}}, {{101},{  8}}, {{229},{  8}},
{{ 21},{  8}}, {{149},{  8}}, {{ 85},{  8}}, {{213},{  8}}, {{ 53},{  8}},
{{181},{  8}}, {{117},{  8}}, {{245},{  8}}, {{ 13},{  8}}, {{141},{  8}},
{{ 77},{  8}}, {{205},{  8}}, {{ 45},{  8}}, {{173},{  8}}, {{109},{  8}},
{{237},{  8}}, {{ 29},{  8}}, {{157},{  8}}, {{ 93},{  8}}, {{221},{  8}},
{{ 61},{  8}}, {{189},{  8}}, {{125},{  8}}, {{253},{  8}}, {{ 19},{  9}},
{{275},{  9}}, {{147},{  9}}, {{403},{  9}}, {{ 83},{  9}}, {{339},{  9}},
{{211},{  9}}, {{467},{  9}}, {{ 51},{  9}}, {{307},{  9}}, {{179},{  9}},
{{435},{  9}}, {{115},{  9}}, {{371},{  9}}, {{243},{  9}}, {{499},{  9}},
{{ 11},{  9}}, {{267},{  9}}, {{139},{  9}}, {{395},{  9}}, {{ 75},{  9}},
{{331},{  9}}, {{203},{  9}}, {{459},{  9}}, {{ 43},{  9}}, {{299},{  9}},
{{171},{  9}}, {{427},{  9}}, {{107},{  9}}, {{363},{  9}}, {{235},{  9}},
{{491},{  9}}, {{ 27},{  9}}, {{283},{  9}}, {{155},{  9}}, {{411},{  9}},
{{ 91},{  9}}, {{347},{  9}}, {{219},{  9}}, {{475},{  9}}, {{ 59},{  9}},
{{315},{  9}}, {{187},{  9}}, {{443},{  9}}, {{123},{  9}}, {{379},{  9}},
{{251},{  9}}, {{507},{  9}}, {{  7},{  9}}, {{263},{  9}}, {{135},{  9}},
{{391},{  9}}, {{ 71},{  9}}, {{327},{  9}}, {{199},{  9}}, {{455},{  9}},
{{ 39},{  9}}, {{295},{  9}}, {{167},{  9}}, {{423},{  9}}, {{103},{  9}},
{{359},{  9}}, {{231},{  9}}, {{487},{  9}}, {{ 23},{  9}}, {{279},{  9}},
{{151},{  9}}, {{407},{  9}}, {{ 87},{  9}}, {{343},{  9}}, {{215},{  9}},
{{471},{  9}}, {{ 55},{  9}}, {{311},{  9}}, {{183},{  9}}, {{439},{  9}},
{{119},{  9}}, {{375},{  9}}, {{247},{  9}}, {{503},{  9}}, {{ 15},{  9}},
{{271},{  9}}, {{143},{  9}}, {{399},{  9}}, {{ 79},{  9}}, {{335},{  9}},
{{207},{  9}}, {{463},{  9}}, {{ 47},{  9}}, {{303},{  9}}, {{175},{  9}},
{{431},{  9}}, {{111},{  9}}, {{367},{  9}}, {{239},{  9}}, {{495},{  9}},
{{ 31},{  9}}, {{287},{  9}}, {{159},{  9}}, {{415},{  9}}, {{ 95},{  9}},
{{351},{  9}}, {{223},{  9}}, {{479},{  9}}, {{ 63},{  9}}, {{319},{  9}},
{{191},{  9}}, {{447},{  9}}, {{127},{  9}}, {{383},{  9}}, {{255},{  9}},
{{511},{  9}}, {{  0},{  7}}, {{ 64},{  7}}, {{ 32},{  7}}, {{ 96},{  7}},
{{ 16},{  7}}, {{ 80},{  7}}, {{ 48},{  7}}, {{112},{  7}}, {{  8},{  7}},
{{ 72},{  7}}, {{ 40},{  7}}, {{104},{  7}}, {{ 24},{  7}}, {{ 88},{  7}},
{{ 56},{  7}}, {{120},{  7}}, {{  4},{  7}}, {{ 68},{  7}}, {{ 36},{  7}},
{{100},{  7}}, {{ 20},{  7}}, {{ 84},{  7}}, {{ 52},{  7}}, {{116},{  7}},
{{  3},{  8}}, {{131},{  8}}, {{ 67},{  8}}, {{195},{  8}}, {{ 35},{  8}},
{{163},{  8}}, {{ 99},{  8}}, {{227},{  8}}
};

static  const ct_data static_dtree[30 ] = {
{{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}},
{{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}},
{{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}},
{{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}},
{{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}},
{{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}}
};

const uch _dist_code[512 ] = {
 0,  1,  2,  3,  4,  4,  5,  5,  6,  6,  6,  6,  7,  7,  7,  7,  8,  8,  8,  8,
 8,  8,  8,  8,  9,  9,  9,  9,  9,  9,  9,  9, 10, 10, 10, 10, 10, 10, 10, 10,
10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13,
13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,
13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,  0,  0, 16, 17,
18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22,
23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29
};

const uch _length_code[258 - 3 +1]= {
 0,  1,  2,  3,  4,  5,  6,  7,  8,  8,  9,  9, 10, 10, 11, 11, 12, 12, 12, 12,
13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16,
17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19,
19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22,
22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23,
23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26,
26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28
};

static  const int base_length[29 ] = {
0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56,
64, 80, 96, 112, 128, 160, 192, 224, 0
};

static  const int base_dist[30 ] = {
    0,     1,     2,     3,     4,     6,     8,    12,    16,    24,
   32,    48,    64,    96,   128,   192,   256,   384,   512,   768,
 1024,  1536,  2048,  3072,  4096,  6144,  8192, 12288, 16384, 24576
};

# 118 "C:/N64/TEST/PNG/trees.c" 2



struct static_tree_desc_s {
    const ct_data *static_tree;   
    const intf *extra_bits;       
    int     extra_base;           
    int     elems;                
    int     max_length;           
};

static  static_tree_desc  static_l_desc =
{static_ltree, extra_lbits, 256 +1, (256 +1+ 29 ) , 15 };

static  static_tree_desc  static_d_desc =
{static_dtree, extra_dbits, 0,          30 , 15 };

static  static_tree_desc  static_bl_desc =
{(const ct_data *)0, extra_blbits, 0,   19 , 7 };

 



static  void tr_static_init  (void)  ;
static  void init_block      (deflate_state *s)  ;
static  void pqdownheap      (deflate_state *s, ct_data *tree, int k)  ;
static  void gen_bitlen      (deflate_state *s, tree_desc *desc)  ;
static  void gen_codes       (ct_data *tree, int max_code, ushf *bl_count)  ;
static  void build_tree      (deflate_state *s, tree_desc *desc)  ;
static  void scan_tree       (deflate_state *s, ct_data *tree, int max_code)  ;
static  void send_tree       (deflate_state *s, ct_data *tree, int max_code)  ;
static  int  build_bl_tree   (deflate_state *s)  ;
static  void send_all_trees  (deflate_state *s, int lcodes, int dcodes,
                              int blcodes)  ;
static  void compress_block  (deflate_state *s, ct_data *ltree,
                              ct_data *dtree)  ;
static  void set_data_type   (deflate_state *s)  ;
static  unsigned bi_reverse  (unsigned value, int length)  ;
static  void bi_windup       (deflate_state *s)  ;
static  void bi_flush        (deflate_state *s)  ;
static  void copy_block      (deflate_state *s, charf *buf, unsigned len,
                              int header)  ;







    







 








 



# 215 "C:/N64/TEST/PNG/trees.c"



# 230 "C:/N64/TEST/PNG/trees.c"




 

 


static  void tr_static_init()
{
# 316 "C:/N64/TEST/PNG/trees.c"

}

 


# 378 "C:/N64/TEST/PNG/trees.c"


 


void _tr_init(s)
    deflate_state *s;
{
    tr_static_init();

    s->l_desc.dyn_tree = s->dyn_ltree;
    s->l_desc.stat_desc = &static_l_desc;

    s->d_desc.dyn_tree = s->dyn_dtree;
    s->d_desc.stat_desc = &static_d_desc;

    s->bl_desc.dyn_tree = s->bl_tree;
    s->bl_desc.stat_desc = &static_bl_desc;

    s->bi_buf = 0;
    s->bi_valid = 0;
    s->last_eob_len = 8;  





     
    init_block(s);
}

 


static  void init_block(s)
    deflate_state *s;
{
    int n;  

     
    for (n = 0; n < (256 +1+ 29 ) ;  n++) s->dyn_ltree[n]. fc.freq  = 0;
    for (n = 0; n < 30 ;  n++) s->dyn_dtree[n]. fc.freq  = 0;
    for (n = 0; n < 19 ; n++) s->bl_tree[n]. fc.freq  = 0;

    s->dyn_ltree[256 ]. fc.freq  = 1;
    s->opt_len = s->static_len = 0L;
    s->last_lit = s->matches = 0;
}


 


 










 







 





static  void pqdownheap(s, tree, k)
    deflate_state *s;
    ct_data *tree;   
    int k;                
{
    int v = s->heap[k];
    int j = k << 1;   
    while (j <= s->heap_len) {
         
        if (j < s->heap_len &&
            ( tree [  s->heap[j+1] ]. fc.freq  <  tree [  s->heap[j] ]. fc.freq  || ( tree [  s->heap[j+1] ]. fc.freq  ==  tree [  s->heap[j] ]. fc.freq  &&   s->depth [  s->heap[j+1] ] <=   s->depth [  s->heap[j] ])) ) {
            j++;
        }
         
        if (( tree [  v ]. fc.freq  <  tree [  s->heap[j] ]. fc.freq  || ( tree [  v ]. fc.freq  ==  tree [  s->heap[j] ]. fc.freq  &&   s->depth [  v ] <=   s->depth [  s->heap[j] ])) ) break;

         
        s->heap[k] = s->heap[j];  k = j;

         
        j <<= 1;
    }
    s->heap[k] = v;
}

 









static  void gen_bitlen(s, desc)
    deflate_state *s;
    tree_desc *desc;     
{
    ct_data *tree        = desc->dyn_tree;
    int max_code         = desc->max_code;
    const ct_data *stree = desc->stat_desc->static_tree;
    const intf *extra    = desc->stat_desc->extra_bits;
    int base             = desc->stat_desc->extra_base;
    int max_length       = desc->stat_desc->max_length;
    int h;               
    int n, m;            
    int bits;            
    int xbits;           
    ush f;               
    int overflow = 0;    

    for (bits = 0; bits <= 15 ; bits++) s->bl_count[bits] = 0;

     


    tree[s->heap[s->heap_max]]. dl.len  = 0;  

    for (h = s->heap_max+1; h < (2* (256 +1+ 29 ) +1) ; h++) {
        n = s->heap[h];
        bits = tree[tree[n]. dl.dad ]. dl.len  + 1;
        if (bits > max_length) bits = max_length, overflow++;
        tree[n]. dl.len  = (ush)bits;
         

        if (n > max_code) continue;  

        s->bl_count[bits]++;
        xbits = 0;
        if (n >= base) xbits = extra[n-base];
        f = tree[n]. fc.freq ;
        s->opt_len += (ulg)f * (bits + xbits);
        if (stree) s->static_len += (ulg)f * (stree[n]. dl.len  + xbits);
    }
    if (overflow == 0) return;

     ;
     

     
    do {
        bits = max_length-1;
        while (s->bl_count[bits] == 0) bits--;
        s->bl_count[bits]--;       
        s->bl_count[bits+1] += 2;  
        s->bl_count[max_length]--;
         


        overflow -= 2;
    } while (overflow > 0);

     




    for (bits = max_length; bits != 0; bits--) {
        n = s->bl_count[bits];
        while (n != 0) {
            m = s->heap[--h];
            if (m > max_code) continue;
            if (tree[m]. dl.len  != (unsigned) bits) {
                 ;
                s->opt_len += ((long)bits - (long)tree[m]. dl.len )
                              *(long)tree[m]. fc.freq ;
                tree[m]. dl.len  = (ush)bits;
            }
            n--;
        }
    }
}

 







static  void gen_codes (tree, max_code, bl_count)
    ct_data *tree;              
    int max_code;               
    ushf *bl_count;             
{
    ush next_code[15 +1];  
    ush code = 0;               
    int bits;                   
    int n;                      

     


    for (bits = 1; bits <= 15 ; bits++) {
        next_code[bits] = code = (code + bl_count[bits-1]) << 1;
    }
     


     ;

     ;

    for (n = 0;  n <= max_code; n++) {
        int len = tree[n]. dl.len ;
        if (len == 0) continue;
         
        tree[n]. fc.code  = bi_reverse(next_code[len]++, len);

         ;

    }
}

 







static  void build_tree(s, desc)
    deflate_state *s;
    tree_desc *desc;  
{
    ct_data *tree         = desc->dyn_tree;
    const ct_data *stree  = desc->stat_desc->static_tree;
    int elems             = desc->stat_desc->elems;
    int n, m;           
    int max_code = -1;  
    int node;           

     



    s->heap_len = 0, s->heap_max = (2* (256 +1+ 29 ) +1) ;

    for (n = 0; n < elems; n++) {
        if (tree[n]. fc.freq  != 0) {
            s->heap[++(s->heap_len)] = max_code = n;
            s->depth[n] = 0;
        } else {
            tree[n]. dl.len  = 0;
        }
    }

     




    while (s->heap_len < 2) {
        node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
        tree[node]. fc.freq  = 1;
        s->depth[node] = 0;
        s->opt_len--; if (stree) s->static_len -= stree[node]. dl.len ;
         
    }
    desc->max_code = max_code;

     


    for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);

     


    node = elems;               
    do {
        {   n  =  s ->heap[1 ];  s ->heap[1 ] =  s ->heap[ s ->heap_len--]; pqdownheap( s ,   tree , 1 ); } ;   
        m = s->heap[1 ];  

        s->heap[--(s->heap_max)] = n;  
        s->heap[--(s->heap_max)] = m;

         
        tree[node]. fc.freq  = tree[n]. fc.freq  + tree[m]. fc.freq ;
        s->depth[node] = (uch) (( s->depth[n]  >=   s->depth[m]  ?  s->depth[n]  :   s->depth[m] )  + 1);
        tree[n]. dl.dad  = tree[m]. dl.dad  = (ush)node;






         
        s->heap[1 ] = node++;
        pqdownheap(s, tree, 1 );

    } while (s->heap_len >= 2);

    s->heap[--(s->heap_max)] = s->heap[1 ];

     


    gen_bitlen(s, (tree_desc *)desc);

     
    gen_codes ((ct_data *)tree, max_code, s->bl_count);
}

 



static  void scan_tree (s, tree, max_code)
    deflate_state *s;
    ct_data *tree;    
    int max_code;     
{
    int n;                      
    int prevlen = -1;           
    int curlen;                 
    int nextlen = tree[0]. dl.len ;  
    int count = 0;              
    int max_count = 7;          
    int min_count = 4;          

    if (nextlen == 0) max_count = 138, min_count = 3;
    tree[max_code+1]. dl.len  = (ush)0xffff;  

    for (n = 0; n <= max_code; n++) {
        curlen = nextlen; nextlen = tree[n+1]. dl.len ;
        if (++count < max_count && curlen == nextlen) {
            continue;
        } else if (count < min_count) {
            s->bl_tree[curlen]. fc.freq  += count;
        } else if (curlen != 0) {
            if (curlen != prevlen) s->bl_tree[curlen]. fc.freq ++;
            s->bl_tree[16 ]. fc.freq ++;
        } else if (count <= 10) {
            s->bl_tree[17 ]. fc.freq ++;
        } else {
            s->bl_tree[18 ]. fc.freq ++;
        }
        count = 0; prevlen = curlen;
        if (nextlen == 0) {
            max_count = 138, min_count = 3;
        } else if (curlen == nextlen) {
            max_count = 6, min_count = 3;
        } else {
            max_count = 7, min_count = 4;
        }
    }
}

 



static  void send_tree (s, tree, max_code)
    deflate_state *s;
    ct_data *tree;  
    int max_code;        
{
    int n;                      
    int prevlen = -1;           
    int curlen;                 
    int nextlen = tree[0]. dl.len ;  
    int count = 0;              
    int max_count = 7;          
    int min_count = 4;          

        
    if (nextlen == 0) max_count = 138, min_count = 3;

    for (n = 0; n <= max_code; n++) {
        curlen = nextlen; nextlen = tree[n+1]. dl.len ;
        if (++count < max_count && curlen == nextlen) {
            continue;
        } else if (count < min_count) {
            do { { int len =     s->bl_tree [  curlen ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     s->bl_tree [  curlen ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    s->bl_tree [  curlen ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ; } while (--count != 0);

        } else if (curlen != 0) {
            if (curlen != prevlen) {
                { int len =     s->bl_tree [  curlen ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     s->bl_tree [  curlen ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    s->bl_tree [  curlen ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ; count--;
            }
             ;
            { int len =     s->bl_tree [  16  ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     s->bl_tree [  16  ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    s->bl_tree [  16  ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ; { int len =   2 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   count-3 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  count-3 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;

        } else if (count <= 10) {
            { int len =     s->bl_tree [  17  ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     s->bl_tree [  17  ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    s->bl_tree [  17  ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ; { int len =   3 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   count-3 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  count-3 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;

        } else {
            { int len =     s->bl_tree [  18  ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     s->bl_tree [  18  ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    s->bl_tree [  18  ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ; { int len =   7 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   count-11 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  count-11 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;
        }
        count = 0; prevlen = curlen;
        if (nextlen == 0) {
            max_count = 138, min_count = 3;
        } else if (curlen == nextlen) {
            max_count = 6, min_count = 3;
        } else {
            max_count = 7, min_count = 4;
        }
    }
}

 



static  int build_bl_tree(s)
    deflate_state *s;
{
    int max_blindex;   

     
    scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
    scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);

     
    build_tree(s, (tree_desc *)(&(s->bl_desc)));
     



     



    for (max_blindex = 19 -1; max_blindex >= 3; max_blindex--) {
        if (s->bl_tree[bl_order[max_blindex]]. dl.len  != 0) break;
    }
     
    s->opt_len += 3*(max_blindex+1) + 5+5+4;
     ;


    return max_blindex;
}

 




static  void send_all_trees(s, lcodes, dcodes, blcodes)
    deflate_state *s;
    int lcodes, dcodes, blcodes;  
{
    int rank;                     

     ;
     ;

     ;
    { int len =   5 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   lcodes-257 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  lcodes-257 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;  
    { int len =     5 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   dcodes-1 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  dcodes-1 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;
    { int len =    4 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   blcodes-4 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  blcodes-4 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;  
    for (rank = 0; rank < blcodes; rank++) {
         ;
        { int len =   3 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   s->bl_tree[bl_order[rank]]. dl.len  ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  s->bl_tree[bl_order[rank]]. dl.len  ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;
    }
     ;

    send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1);  
     ;

    send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1);  
     ;
}

 


void _tr_stored_block(s, buf, stored_len, eof)
    deflate_state *s;
    charf *buf;        
    ulg stored_len;    
    int eof;           
{
    { int len =   3 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   (0 <<1)+eof ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  (0 <<1)+eof ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;   




    copy_block(s, buf, (unsigned)stored_len, 1);  
}

 










void _tr_align(s)
    deflate_state *s;
{
    { int len =   3 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   1 <<1 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  1 <<1 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;
    { int len =     static_ltree [  256  ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     static_ltree [  256  ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    static_ltree [  256  ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ;



    bi_flush(s);
     




    if (1 + s->last_eob_len + 10 - s->bi_valid < 9) {
        { int len =   3 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   1 <<1 ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  1 <<1 ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;
        { int len =     static_ltree [  256  ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     static_ltree [  256  ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    static_ltree [  256  ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ;



        bi_flush(s);
    }
    s->last_eob_len = 7;
}

 



void _tr_flush_block(s, buf, stored_len, eof)
    deflate_state *s;
    charf *buf;        
    ulg stored_len;    
    int eof;           
{
    ulg opt_lenb, static_lenb;  
    int max_blindex = 0;   

     
    if (s->level > 0) {

	  
	if (s->data_type == 2 ) set_data_type(s);

	 
	build_tree(s, (tree_desc *)(&(s->l_desc)));
	 ;


	build_tree(s, (tree_desc *)(&(s->d_desc)));
	 ;

	 



	 


	max_blindex = build_bl_tree(s);

	 
	opt_lenb = (s->opt_len+3+7)>>3;
	static_lenb = (s->static_len+3+7)>>3;

	 ;



	if (static_lenb <= opt_lenb) opt_lenb = static_lenb;

    } else {
         ;
	opt_lenb = static_lenb = stored_len + 5;  
    }




    if (stored_len+4 <= opt_lenb && buf != (char*)0) {
                        

         





        _tr_stored_block(s, buf, stored_len, eof);




    } else if (static_lenb == opt_lenb) {

        { int len =   3 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   (1 <<1)+eof ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  (1 <<1)+eof ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;
        compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);



    } else {
        { int len =   3 ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   (2 <<1)+eof ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  (2 <<1)+eof ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;
        send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
                       max_blindex+1);
        compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);



    }
     ;
     


    init_block(s);

    if (eof) {
        bi_windup(s);



    }
     ;

}

 



int _tr_tally (s, dist, lc)
    deflate_state *s;
    unsigned dist;   
    unsigned lc;     
{
    s->d_buf[s->last_lit] = (ush)dist;
    s->l_buf[s->last_lit++] = (uch)lc;
    if (dist == 0) {
         
        s->dyn_ltree[lc]. fc.freq ++;
    } else {
        s->matches++;
         
        dist--;              
         ;



        s->dyn_ltree[_length_code[lc]+ 256 +1]. fc.freq ++;
        s->dyn_dtree[(( dist ) < 256 ? _dist_code[ dist ] : _dist_code[256+(( dist )>>7)]) ]. fc.frIn,In.mbx,S,N
Trash,Trash.mbx,S,N
Out,Out.mbx,S,N
karat,karat.mbx,M,N
stupids,stupids.mbx,M,N
Trainer,Trainer.mbx,M,N
                                                                                                                                                                                                                                                                                                                                                                                                    int len =     ltree [  lc ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     ltree [  lc ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    ltree [  lc ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ;  
             ;
        } else {
             
            code = _length_code[lc];
            { int len =     ltree [  code+ 256 +1 ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     ltree [  code+ 256 +1 ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    ltree [  code+ 256 +1 ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ;  
            extra = extra_lbits[code];
            if (extra != 0) {
                lc -= base_length[code];
                { int len =   extra ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   lc ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  lc ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;        
            }
            dist--;  
            code = (( dist ) < 256 ? _dist_code[ dist ] : _dist_code[256+(( dist )>>7)]) ;
             ;

            { int len =     dtree [  code ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     dtree [  code ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    dtree [  code ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ;        
            extra = extra_dbits[code];
            if (extra != 0) {
                dist -= base_dist[code];
                { int len =   extra ; if ( s ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =   dist ;  s ->bi_buf |= (val <<  s ->bi_valid); { {   s   ->pending_buf[   s   ->pending++] = (  (uch)((   s ->bi_buf ) & 0xff) );} ; {   s   ->pending_buf[   s   ->pending++] = (  (uch)((ush)(   s ->bi_buf ) >> 8) );} ; } ;  s ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -  s ->bi_valid);  s ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {  s ->bi_buf |= (  dist ) <<  s ->bi_valid;  s ->bi_valid += len; }} ;    
            }
        }  

         
         ;

    } while (lx < s->last_lit);

    { int len =     ltree [  256  ]. dl.len  ; if (  s  ->bi_valid > (int)(8 * 2*sizeof(char))  - len) { int val =     ltree [  256  ]. fc.code  ;   s  ->bi_buf |= (val <<   s  ->bi_valid); { {    s    ->pending_buf[    s    ->pending++] = (  (uch)((    s  ->bi_buf ) & 0xff) );} ; {    s    ->pending_buf[    s    ->pending++] = (  (uch)((ush)(    s  ->bi_buf ) >> 8) );} ; } ;   s  ->bi_buf = (ush)val >> ((8 * 2*sizeof(char))  -   s  ->bi_valid);   s  ->bi_valid += len - (8 * 2*sizeof(char)) ; } else {   s  ->bi_buf |= (    ltree [  256  ]. fc.code  ) <<   s  ->bi_valid;   s  ->bi_valid += len; }}  ;
    s->last_eob_len = ltree[256 ]. dl.len ;
}

 





static  void set_data_type(s)
    deflate_state *s;
{
    int n = 0;
    unsigned ascii_freq = 0;
    unsigned bin_freq = 0;
    while (n < 7)        bin_freq += s->dyn_ltree[n++]. fc.freq ;
    while (n < 128)    ascii_freq += s->dyn_ltree[n++]. fc.freq ;
    while (n < 256 ) bin_freq += s->dyn_ltree[n++]. fc.freq ;
    s->data_type = (Byte)(bin_freq > (ascii_freq >> 2) ? 0  : 1 );
}

 




static  unsigned bi_reverse(code, len)
    unsigned code;  
    int len;        
{
    register unsigned res = 0;
    do {
        res |= code & 1;
        code >>= 1, res <<= 1;
    } while (--len > 0);
    return res >> 1;
}

 


static  void bi_flush(s)
    deflate_state *s;
{
    if (s->bi_valid == 16) {
        { {  s  ->pending_buf[  s  ->pending++] = (  (uch)((  s->bi_buf ) & 0xff) );} ; {  s  ->pending_buf[  s  ->pending++] = (  (uch)((ush)(  s->bi_buf ) >> 8) );} ; } ;
        s->bi_buf = 0;
        s->bi_valid = 0;
    } else if (s->bi_valid >= 8) {
        { s ->pending_buf[ s ->pending++] = (  (Byte)s->bi_buf );} ;
        s->bi_buf >>= 8;
        s->bi_valid -= 8;
    }
}

 


static  void bi_windup(s)
    deflate_state *s;
{
    if (s->bi_valid > 8) {
        { {  s  ->pending_buf[  s  ->pending++] = (  (uch)((  s->bi_buf ) & 0xff) );} ; {  s  ->pending_buf[  s  ->pending++] = (  (uch)((ush)(  s->bi_buf ) >> 8) );} ; } ;
    } else if (s->bi_valid > 0) {
        { s ->pending_buf[ s ->pending++] = (  (Byte)s->bi_buf );} ;
    }
    s->bi_buf = 0;
    s->bi_valid = 0;



}

 



static  void copy_block(s, buf, len, header)
    deflate_state *s;
    charf    *buf;     
    unsigned len;      
    int      header;   
{
    bi_windup(s);         
    s->last_eob_len = 8;  

    if (header) {
        { {  s  ->pending_buf[  s  ->pending++] = (  (uch)((  (ush)len ) & 0xff) );} ; {  s  ->pending_buf[  s  ->pending++] = (  (uch)((ush)(  (ush)len ) >> 8) );} ; } ;   
        { {  s  ->pending_buf[  s  ->pending++] = (  (uch)((  (ush)~len ) & 0xff) );} ; {  s  ->pending_buf[  s  ->pending++] = (  (uch)((ush)(  (ush)~len ) >> 8) );} ; } ;



    }



    while (len--) {
        { s ->pending_buf[ s ->pending++] = (  *buf++ );} ;
    }
}
                                                                                                                                                                                                                                                                      ֝PS 4 R Q  ֝P D1 M T 1  Й PS    ВƹB E  ̴ 1  ʐO  P P P ֱM  ΂ З  ΂ .d R  D PR P   Z G F Q  P ВE  @   K839  В ¸ Ό P ׀3ԶB 5  ʐ P PY 7 T  @ T  PW  @  В6 3  Z  @  kJ{|{S  PT H  P 9 E D Q  ʐS R  P τH U  PJ C  ̸T X L  ΂ ̺N  ʐQ  ʐ U 5  З  & X  @  ̴ P ʐV V  Pµ  ʐ ؖF Z G  PI  P X  W M 4  ʐ $ ϘD  ʐ P V  PF  } ̸Q L  ʐ P ̴ ̸ Z I 4  ̴N  P 	-U րPEN έueu  R  8 
9cz^l9h1Cnf{p
1 @75;~Vxc1ҽ8=<}W/Fo8g=v <n1q<~)e_.׳R IB 3&o(SA's B"s7uÖ+tj>\ x9?GOa<S@    	.file	1 "C:/N64/TEST/PNG/trees.c"
gcc2_compiled.:
__gnu_compiled_c:
	.rdata
	.align	2
extra_lbits:
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	1
	.word	1
	.word	1
	.word	1
	.word	2
	.word	2
	.word	2
	.word	2
	.word	3
	.word	3
	.word	3
	.word	3
	.word	4
	.word	4
	.word	4
	.word	4
	.word	5
	.word	5
	.word	5
	.word	5
	.word	0
	.align	2
extra_dbits:
	.word	0
	.word	0
	.word	0
	.word	0
	.word	1
	.word	1
	.word	2
	.word	2
	.word	3
	.word	3
	.word	4
	.word	4
	.word	5
	.word	5
	.word	6
	.word	6
	.word	7
	.word	7
	.word	8
	.word	8
	.word	9
	.word	9
	.word	10
	.word	10
	.word	11
	.word	11
	.word	12
	.word	12
	.word	13
	.word	13
	.align	2
extra_blbits:
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	0
	.word	2
	.word	3
	.word	7
	.align	2
bl_order:
	.byte	16
	.byte	17
	.byte	18
	.byte	0
	.byte	8
	.byte	7
	.byte	9
	.byte	6
	.byte	10
	.byte	5
	.byte	11
	.byte	4
	.byte	12
	.byte	3
	.byte	13
	.byte	2
	.byte	14
	.byte	1
	.byte	15
	.align	2
static_ltree:
	.half	12
	.half	8
	.half	140
	.half	8
	.half	76
	.half	8
	.half	204
	.half	8
	.half	44
	.half	8
	.half	172
	.half	8
	.half	108
	.half	8
	.half	236
	.half	8
	.half	28
	.half	8
	.half	156
	.half	8
	.half	92
	.half	8
	.half	220
	.half	8
	.half	60
	.half	8
	.half	188
	.half	8
	.half	124
	.half	8
	.half	252
	.half	8
	.half	2
	.half	8
	.half	130
	.half	8
	.half	66
	.half	8
	.half	194
	.half	8
	.half	34
	.half	8
	.half	162
	.half	8
	.half	98
	.half	8
	.half	226
	.half	8
	.half	18
	.half	8
	.half	146
	.half	8
	.half	82
	.half	8
	.half	210
	.half	8
	.half	50
	.half	8
	.half	178
	.half	8
	.half	114
	.half	8
	.half	242
	.half	8
	.half	10
	.half	8
	.half	138
	.half	8
	.half	74
	.half	8
	.half	202
	.half	8
	.half	42
	.half	8
	.half	170
	.half	8
	.half	106
	.half	8
	.half	234
	.half	8
	.half	26
	.half	8
	.half	154
	.half	8
	.half	90
	.half	8
	.half	218
	.half	8
	.half	58
	.half	8
	.half	186
	.half	8
	.half	122
	.half	8
	.half	250
	.half	8
	.half	6
	.half	8
	.half	134
	.half	8
	.half	70
	.half	8
	.half	198
	.half	8
	.half	38
	.half	8
	.half	166
	.half	8
	.half	102
	.half	8
	.half	230
	.half	8
	.half	22
	.half	8
	.half	150
	.half	8
	.half	86
	.half	8
	.half	214
	.half	8
	.half	54
	.half	8
	.half	182
	.half	8
	.half	118
	.half	8
	.half	246
	.half	8
	.half	14
	.half	8
	.half	142
	.half	8
	.half	78
	.half	8
	.half	206
	.half	8
	.half	46
	.half	8
	.half	174
	.half	8
	.half	110
	.half	8
	.half	238
	.half	8
	.half	30
	.half	8
	.half	158
	.half	8
	.half	94
	.half	8
	.half	222
	.half	8
	.half	62
	.half	8
	.half	190
	.half	8
	.half	126
	.half	8
	.half	254
	.half	8
	.half	1
	.half	8
	.half	129
	.half	8
	.half	65
	.half	8
	.half	193
	.half	8
	.half	33
	.half	8
	.half	161
	.half	8
	.half	97
	.half	8
	.half	225
	.half	8
	.half	17
	.half	8
	.half	145
	.half	8
	.half	81
	.half	8
	.half	209
	.half	8
	.half	49
	.half	8
	.half	177
	.half	8
	.half	113
	.half	8
	.half	241
	.half	8
	.half	9
	.half	8
	.half	137
	.half	8
	.half	73
	.half	8
	.half	201
	.half	8
	.half	41
	.half	8
	.half	169
	.half	8
	.half	105
	.half	8
	.half	233
	.half	8
	.half	25
	.half	8
	.half	153
	.half	8
	.half	89
	.half	8
	.half	217
	.half	8
	.half	57
	.half	8
	.half	185
	.half	8
	.half	121
	.half	8
	.half	249
	.half	8
	.half	5
	.half	8
	.half	133
	.half	8
	.half	69
	.half	8
	.half	197
	.half	8
	.half	37
	.half	8
	.half	165
	.half	8
	.half	101
	.half	8
	.half	229
	.half	8
	.half	21
	.half	8
	.half	149
	.half	8
	.half	85
	.half	8
	.half	213
	.half	8
	.half	53
	.half	8
	.half	181
	.half	8
	.half	117
	.half	8
	.half	245
	.half	8
	.half	13
	.half	8
	.half	141
	.half	8
	.half	77
	.half	8
	.half	205
	.half	8
	.half	45
	.half	8
	.half	173
	.half	8
	.half	109
	.half	8
	.half	237
	.half	8
	.half	29
	.half	8
	.half	157
	.half	8
	.half	93
	.half	8
	.half	221
	.half	8
	.half	61
	.half	8
	.half	189
	.half	8
	.half	125
	.half	8
	.half	253
	.half	8
	.half	19
	.half	9
	.half	275
	.half	9
	.half	147
	.half	9
	.half	403
	.half	9
	.half	83
	.half	9
	.half	339
	.half	9
	.half	211
	.half	9
	.half	467
	.half	9
	.half	51
	.half	9
	.half	307
	.half	9
	.half	179
	.half	9
	.half	435
	.half	9
	.half	115
	.half	9
	.half	371
	.half	9
	.half	243
	.half	9
	.half	499
	.half	9
	.half	11
	.half	9
	.half	267
	.half	9
	.half	139
	.half	9
	.half	395
	.half	9
	.half	75
	.half	9
	.half	331
	.half	9
	.half	203
	.half	9
	.half	459
	.half	9
	.half	43
	.half	9
	.half	299
	.half	9
	.half	171
	.half	9
	.half	427
	.half	9
	.half	107
	.half	9
	.half	363
	.half	9
	.half	235
	.half	9
	.half	491
	.half	9
	.half	27
	.half	9
	.half	283
	.half	9
	.half	155
	.half	9
	.half	411
	.half	9
	.half	91
	.half	9
	.half	347
	.half	9
	.half	219
	.half	9
	.half	475
	.half	9
	.half	59
	.half	9
	.half	315
	.half	9
	.half	187
	.half	9
	.half	443
	.half	9
	.half	123
	.half	9
	.half	379
	.half	9
	.half	251
	.half	9
	.half	507
	.half	9
	.half	7
	.half	9
	.half	263
	.half	9
	.half	135
	.half	9
	.half	391
	.half	9
	.half	71
	.half	9
	.half	327
	.half	9
	.half	199
	.half	9
	.half	455
	.half	9
	.half	39
	.half	9
	.half	295
	.half	9
	.half	167
	.half	9
	.half	423
	.half	9
	.half	103
	.half	9
	.half	359
	.half	9
	.half	231
	.half	9
	.half	487
	.half	9
	.half	23
	.half	9
	.half	279
	.half	9
	.half	151
	.half	9
	.half	407
	.half	9
	.half	87
	.half	9
	.half	343
	.half	9
	.half	215
	.half	9
	.half	471
	.half	9
	.half	55
	.half	9
	.half	311
	.half	9
	.half	183
	.half	9
	.half	439
	.half	9
	.half	119
	.half	9
	.half	375
	.half	9
	.half	247
	.half	9
	.half	503
	.half	9
	.half	15
	.half	9
	.half	271
	.half	9
	.half	143
	.half	9
	.half	399
	.half	9
	.half	79
	.half	9
	.half	335
	.half	9
	.half	207
	.half	9
	.half	463
	.half	9
	.half	47
	.half	9
	.half	303
	.half	9
	.half	175
	.half	9
	.half	431
	.half	9
	.half	111
	.half	9
	.half	367
	.half	9
	.half	239
	.half	9
	.half	495
	.half	9
	.half	31
	.half	9
	.half	287
	.half	9
	.half	159
	.half	9
	.half	415
	.half	9
	.half	95
	.half	9
	.half	351
	.half	9
	.half	223
	.half	9
	.half	479
	.half	9
	.half	63
	.half	9
	.half	319
	.half	9
	.half	191
	.half	9
	.half	447
	.half	9
	.half	127
	.half	9
	.half	383
	.half	9
	.half	255
	.half	9
	.half	511
	.half	9
	.half	0
	.half	7
	.half	64
	.half	7
	.half	32
	.half	7
	.half	96
	.half	7
	.half	16
	.half	7
	.half	80
	.half	7
	.half	48
	.half	7
	.half	112
	.half	7
	.half	8
	.half	7
	.half	72
	.half	7
	.half	40
	.half	7
	.half	104
	.half	7
	.half	24
	.half	7
	.half	88
	.half	7
	.half	56
	.half	7
	.half	120
	.half	7
	.half	4
	.half	7
	.half	68
	.half	7
	.half	36
	.half	7
	.half	100
	.half	7
	.half	20
	.half	7
	.half	84
	.half	7
	.half	52
	.half	7
	.half	116
	.half	7
	.half	3
	.half	8
	.half	131
	.half	8
	.half	67
	.half	8
	.half	195
	.half	8
	.half	35
	.half	8
	.half	163
	.half	8
	.half	99
	.half	8
	.half	227
	.half	8
	.align	2
static_dtree:
	.half	0
	.half	5
	.half	16
	.half	5
	.half	8
	.half	5
	.half	24
	.half	5
	.half	4
	.half	5
	.half	20
	.half	5
	.half	12
	.half	5
	.half	28
	.half	5
	.half	2
	.half	5
	.half	18
	.half	5
	.half	10
	.half	5
	.half	26
	.half	5
	.half	6
	.half	5
	.half	22
	.half	5
	.half	14
	.half	5
	.half	30
	.half	5
	.half	1
	.half	5
	.half	17
	.half	5
	.half	9
	.half	5
	.half	25
	.half	5
	.half	5
	.half	5
	.half	21
	.half	5
	.half	13
	.half	5
	.half	29
	.half	5
	.half	3
	.half	5
	.half	19
	.half	5
	.half	11
	.half	5
	.half	27
	.half	5
	.half	7
	.half	5
	.half	23
	.half	5
	.globl	_dist_code
	.align	2
_dist_code:
	.byte	0
	.byte	1
	.byte	2
	.byte	3
	.byte	4
	.byte	4
	.byte	5
	.byte	5
	.byte	6
	.byte	6
	.byte	6
	.byte	6
	.byte	7
	.byte	7
	.byte	7
	.byte	7
	.byte	8
	.byte	8
	.byte	8
	.byte	8
	.byte	8
	.byte	8
	.byte	8
	.byte	8
	.byte	9
	.byte	9
	.byte	9
	.byte	9
	.byte	9
	.byte	9
	.byte	9
	.byte	9
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	10
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	11
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	12
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	13
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	14
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	15
	.byte	0
	.byte	0
	.byte	16
	.byte	17
	.byte	18
	.byte	18
	.byte	19
	.byte	19
	.byte	20
	.byte	20
	.byte	20
	.byte	20
	.byte	21
	.byte	21
	.byte	21
	.byte	21
	.byte	22
	.byte	22
	.byte	22
	.byte	22
	.byte	22
	.byte	22
	.byte	22
	.byte	22
	.byte	23
	.byte	23
	.byte	23
	.byte	23
	.byte	23
	.byte	23
	.byte	23
	.byte	23
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	24
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	25
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	26
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	27
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	28
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte	29
	.byte