local _ssssssssss = (function()


local unpack = table.unpack
local pack = table.pack
local select = select
local type = type

local _e4JpXAHUv
do
	local ok, e = pcall(function()
		return getfenv() 
	end)
	_e4JpXAHUv = ok and type(e) == 'table' and e or _G
end

local _UHUzdxdY7 = {protos = {}, enc = false, key = 0, cache = {}}

local function _ezfHHchKC(v)
	return v ~= nil and v ~= false
end

local function _uIXXQgh1P(s)
	if s:byte(1) == 1 then
		local n = #s - 1
		local out = table.create(n)
		local seed = (57 + _UHUzdxdY7.key * 17) % 256
		local inv = _UHUzdxdY7.sbox_inv
		for i = 1, n do
			local b = s:byte(i + 1)
			if inv then b = inv[b] end
			out[i] = string.char(bit32.bxor(b, seed, 92))
			seed = (141 * seed + 29) % 256
		end
		return table.concat(out)
	end
	return s
end

local function _RSBuAtCZD(v)
	if type(v) ~= 'string' or not _UHUzdxdY7.enc then
		return v
	end
	local c = _UHUzdxdY7.cache[v]
	if c ~= nil then
		return c
	end
	c = _uIXXQgh1P(v)
	_UHUzdxdY7.cache[v] = c
	return c
end

local CELL_MT = {}
local function _Q9qshlNgM(v)
	return setmetatable({v = v}, CELL_MT)
end

local function cellval(v)
	if type(v) == 'table' and getmetatable(v) == CELL_MT then
		return v.v
	end
	return v
end

local function cellput(q, i, v)
	local c = q[i]
	if type(c) == 'table' and getmetatable(c) == CELL_MT then
		c.v = v
	else
		q[i] = v
	end
end


local function _iuGYKAhT5(pid, ups)
	return function(...)
		return _UHUzdxdY7._ysnQUTxgF(pid, ups, ...)
	end
end

local function _FmgptrPmZ(f, q, base, argc)
	local args = table.create(argc)
	for i = 1, argc do
		args[i] = cellval(q[base + i])
	end
	return pack(f(unpack(args, 1, argc)))
end

function _UHUzdxdY7._ysnQUTxgF(pid, ups, ...)
	local p = _UHUzdxdY7.protos[pid]
	if not p then
		error('', 0)
	end
	local q = {}
	local rb = _UHUzdxdY7.regbase or 0
	local np = p.params
	local nargs = select('#', ...)
	for i = 1, np do
		q[rb + i - 1] = (select(i, ...))
	end
	local va, nva = {}, 0
	if p.vararg then
		nva = nargs - np
		for i = 1, nva do
			va[i] = select(np + i, ...)
		end
	end
	local code = p.code
	local n = #code
	local pc = 1
	local top = rb - 1
	while pc >= 1 and pc <= n do
		local ins = code[pc]
		local op = _UHUzdxdY7.opmap and _UHUzdxdY7.opmap[ins[1]] or bit32.bxor(ins[1], _UHUzdxdY7.opkey)
		if op == 16 then 
			q[ins.B] = _RSBuAtCZD(ins.K3)
			pc = pc + 1
		elseif op == 94 then 
			q[ins.A] = q[ins.C] <= q[ins.B]
			pc = pc + 1
		elseif op == 134 or op == 0x108 then 
			pc = pc + 1
		elseif op == 158 then 
			q[ins.B] = -q[ins.A]
			pc = pc + 1
		elseif op == 0x10E then 
			pc = pc + 1
		elseif op == 173 then 
			pc = ins.B + 1
		elseif op == 0x100 then 
			local vals = table.create(ins.B)
			for i = 0, ins.B - 1 do
				vals[i + 1] = cellval(q[ins.A + i])
			end
			return unpack(vals, 1, ins.B)
		elseif op == 0x10D then 
			local base = ins.A
			local limit, step = tonumber(cellval(q[base])), tonumber(cellval(q[base + 1]))
			local idx = tonumber(cellval(q[base + 2])) + step
			cellput(q, base + 2, idx)
			if (step > 0 and idx <= limit) or (step <= 0 and limit <= idx) then
				pc = ins.C + 1
			else
				pc = pc + 1
			end
		elseif op == 220 or op == 4 then 
			q[ins.A] = q[ins.B] + q[ins.C]
			pc = pc + 1
		elseif op == 43 then 
			q[ins.B] = q[ins.C] * q[ins.A]
			pc = pc + 1
		elseif op == 81 then 
			q[ins.B] = q[ins.A]
			pc = pc + 1
		elseif op == 126 then 
			q[ins.C] = q[ins.B] - ins.K3
			pc = pc + 1
		elseif op == 55 then 
			q[ins.A] = q[ins.B] == nil
			pc = pc + 1
		elseif op == 180 then 
			q[ins.B] = nil
			pc = pc + 1
		elseif op == 73 then 
			local base = ins.C
			q[base](q[base + 1])
			pc = pc + 1
		elseif op == 0x111 then 
			q[ins.A] = q[ins.B] ^ q[ins.C]
			pc = pc + 1
		elseif op == 65 then 
			return
		elseif op == 45 then 
			q[ins.C] = q[ins.A] % q[ins.B]
			pc = pc + 1
		elseif op == 207 then 
			pc = q[ins.C] ~= q[ins.B] and ins.A + 1 or pc + 1
		elseif op == 165 then 
			q[ins.B] = q[ins.A] == q[ins.C]
			pc = pc + 1
		elseif op == 147 then 
			q[ins.C] = q[ins.A] / q[ins.B]
			pc = pc + 1
		elseif op == 0x105 then 
			local c = q[ins.B]
			q[ins.A] = type(c) == 'table' and c.v or c
			pc = pc + 1
		elseif op == 35 then 
			q[ins.A] = {}
			pc = pc + 1
		elseif op == 25 then 
			q[ins.C][_RSBuAtCZD(ins.K3)] = q[ins.B]
			pc = pc + 1
		elseif op == 0x107 then 
			local base, argc, nres = ins.A, ins.B, ins.C
			if argc < 0 then
				argc = top - base
				if argc < 0 then
					argc = 0
				end
			end
			local r = _FmgptrPmZ(q[base], q, base, argc)
			if nres < 0 then
				for i = 1, r.n do
					q[base + i - 1] = r[i]
				end
				top = base + r.n - 1
			else
				for i = 1, nres do
					q[base + i - 1] = r[i]
				end
				top = base + nres - 1
			end
			pc = pc + 1
		elseif op == 157 then 
			for i = ins.B, ins.A do
				q[i] = nil
			end
			pc = pc + 1
		elseif op == 117 then 
			q[ins.A] = ups[ins.B + 1].v
			pc = pc + 1
		elseif op == 46 then 
			local r = pack(q[ins.A]())
			q[ins.A] = r[1]
			top = ins.A
			pc = pc + 1
		elseif op == 49 then 
			local caps = ins.K2 or {}
			local children = {}
			for i = 1, #caps do
				local desc = caps[i]
				local kind, idx = desc[1], desc[2]
				if kind == 0 then
					children[i] = _Q9qshlNgM(q[idx])
				elseif kind == 1 then
					local c = q[idx]
					if type(c) ~= 'table' then
						c = _Q9qshlNgM(c)
						q[idx] = c
					end
					children[i] = c
				else
					children[i] = ups[idx + 1]
				end
			end
			local newclos = _iuGYKAhT5(ins.C, children)
			local target = q[ins.A]
			if type(target) == 'table' and getmetatable(target) == CELL_MT then
				target.v = newclos
			else
				q[ins.A] = newclos
			end
			
			
			for i = 1, #caps do
				local desc = caps[i]
				if desc[1] == 0 and desc[2] == ins.A then
					children[i].v = newclos
				end
			end
			pc = pc + 1
		elseif op == 0x10B then 
			q[ins.A] = math.floor(q[ins.B] / q[ins.C])
			pc = pc + 1
		elseif op == 148 then 
			ups[ins.A + 1].v = q[ins.C]
			pc = pc + 1
		elseif op == 67 then 
			q[ins.C] = not _ezfHHchKC(q[ins.B])
			pc = pc + 1
		elseif op == 0x106 then 
			local c = q[ins.A]
			if type(c) ~= 'table' then
				c = _Q9qshlNgM(nil)
				q[ins.A] = c
			end
			c.v = q[ins.B]
			pc = pc + 1
		elseif op == 69 then 
			local base, argc = ins.A, ins.B - 1
			local r = _FmgptrPmZ(q[base], q, base, argc)
			for i = 1, r.n do
				q[base + i - 1] = r[i]
			end
			top = base + r.n - 1
			pc = pc + 1
		elseif op == 108 then 
			q[ins.A] = q[ins.B] - q[ins.C]
			pc = pc + 1
		elseif op == 92 then 
			q[ins.A] = #q[ins.C]
			pc = pc + 1
		elseif op == 98 then 
			q[ins.B] = _e4JpXAHUv[_RSBuAtCZD(ins.K2)]
			pc = pc + 1
		elseif op == 44 then 
			local base, argc = ins.C, ins.B - 1
			local r = _FmgptrPmZ(q[base], q, base, argc)
			q[base] = r[1]
			top = base
			pc = pc + 1
		elseif op == 110 then 
			q[ins.B] = q[ins.A] + ins.K2
			pc = pc + 1
		elseif op == 0x104 then 
			local t = cellval(q[ins.A])
			local from, cnt, idx = ins.B, ins.C, ins.K1 or 1
			if cnt < 0 then
				cnt = top - from + 1
			end
			for i = 0, cnt - 1 do
				t[idx + i] = cellval(q[from + i])
			end
			pc = pc + 1
		elseif op == 0x102 then 
			_e4JpXAHUv[_RSBuAtCZD(ins.K2)] = q[ins.B]
			pc = pc + 1
		elseif op == 58 then 
			return cellval(q[ins.A])
		elseif op == 41 then 
			q[ins.B][q[ins.C]] = q[ins.A]
			pc = pc + 1
		elseif op == 106 then 
			local r = pack(q[ins.B](q[ins.B + 1], q[ins.B + 2]))
			q[ins.B] = r[1]
			top = ins.B
			pc = pc + 1
		elseif op == 0x10C then 
			local base = ins.A
			local limit, step = tonumber(cellval(q[base])), tonumber(cellval(q[base + 1]))
			local idx = tonumber(cellval(q[base + 2]))
			cellput(q, base, limit)
			cellput(q, base + 1, step)
			cellput(q, base + 2, idx)
			local go = (step > 0 and idx <= limit) or (step <= 0 and limit <= idx)
			pc = go and pc + 1 or ins.C + 1
		elseif op == 119 then 
			q[ins.C] = q[ins.A][q[ins.B]]
			pc = pc + 1
		elseif op == 0x109 then 
			local dst, src = ins.A, ins.B
			local cnt = top - src + 1
			if cnt < 0 then
				cnt = 0
			end
			for i = 0, cnt - 1 do
				local v = cellval(q[src + i])
				local c = q[dst + i]
				if type(c) == 'table' and getmetatable(c) == CELL_MT then
					c.v = v
				else
					q[dst + i] = v
				end
			end
			top = dst + cnt - 1
			pc = pc + 1
		elseif op == 0x10A then 
			local from = ins.A
			for _, r in ipairs(p.boxed or {}) do
				if r >= from then
					local c = q[r]
					q[r] = _Q9qshlNgM(type(c) == 'table' and c.v or c)
				end
			end
			pc = pc + 1
		elseif op == 0x110 then 
			q[ins.A] = _Q9qshlNgM(q[ins.A])
			pc = pc + 1
		elseif op == 127 then 
			q[ins.B] = q[ins.A] ~= q[ins.C]
			pc = pc + 1
		elseif op == 0 then 
			q[ins.A] = q[ins.C][_RSBuAtCZD(ins.K1)]
			pc = pc + 1
		elseif op == 171 then 
			local r = pack(q[ins.A](q[ins.A + 1]))
			q[ins.A] = r[1]
			top = ins.A
			pc = pc + 1
		elseif op == 208 then 
			q[ins.B] = q[ins.A] .. q[ins.C]
			pc = pc + 1
		elseif op == 141 then 
			q[ins.A] = q[ins.B] > q[ins.C]
			pc = pc + 1
		elseif op == 0x103 then 
			local dst, cnt = ins.A, ins.B
			if cnt < 0 then
				cnt = nva
			end
			for i = 1, cnt do
				cellput(q, dst + i - 1, va[i])
			end
			top = dst + cnt - 1
			pc = pc + 1
		elseif op == 109 then 
			pc = q[ins.B] == _RSBuAtCZD(ins.K2) and ins.A + 1 or pc + 1
		elseif op == 166 then 
			q[ins.B] = q[ins.A] >= q[ins.C]
			pc = pc + 1
		elseif op == 14 then 
			pc = _ezfHHchKC(q[ins.B]) and ins.C + 1 or pc + 1
		elseif op == 72 then 
			pc = _ezfHHchKC(q[ins.B]) and pc + 1 or ins.A + 1
		elseif op == 0x10F then 
			local base, nvars = ins.A, ins.B
			local r = pack(cellval(q[base])(cellval(q[base + 1]), cellval(q[base + 2])))
			if r[1] == nil then
				pc = pc + 1
			else
				cellput(q, base + 2, r[1])
				cellput(q, base + 3, r[1])
				cellput(q, base + 4, r[2])
				for i = 3, nvars do
					cellput(q, base + 2 + i, r[i])
				end
				pc = ins.C + 1
			end
		elseif op == 0x101 then 
			local last = top >= ins.A and top or ins.A - 1
			local vals = {}
			for i = ins.A, last do
				vals[#vals + 1] = cellval(q[i])
			end
			return unpack(vals, 1, #vals)
		else
			error('', 0)
		end
	end
end



local function b_u8(s, p)
	return s:byte(p), p + 1
end

local function b_u32(s, p)
	local a, b, c, d = s:byte(p, p + 3)
	return a + b * 256 + c * 65536 + d * 16777216, p + 4
end

local function b_f64(s, p)
	local v, np = string.unpack('<d', s, p)
	return v, np
end

local function b_str(s, p)
	local n, np = b_u32(s, p)
	return s:sub(np, np + n - 1), np + n
end

local function b_val(s, p)
	local t
	t, p = b_u8(s, p)
	if t == 0 then
		return nil, p
	elseif t == 1 then
		return b_f64(s, p)
	elseif t == 2 then
		return b_str(s, p)
	elseif t == 3 then
		local n, np = b_u32(s, p)
		local out = {}
		p = np
		for i = 1, n do
			out[i], p = b_val(s, p)
		end
		return out, p
	elseif t == 4 then
		local b, np = b_u8(s, p)
		return b ~= 0, np
	end
	error('', 0)
end

local function b_xs(state)
	state = bit32.bxor(state, bit32.lshift(state, 13))
	state = bit32.bxor(state, bit32.rshift(state, 17))
	state = bit32.bxor(state, bit32.lshift(state, 5))
	return state
end

local function decode_binary(hex)
	local bytes = {}
	for i = 1, #hex, 2 do
		local v = tonumber(hex:sub(i, i + 1), 16)
		if not v then error('', 0) end
		bytes[#bytes + 1] = string.char(v)
	end
	local s = table.concat(bytes)
	if s:sub(1, 4) ~= 'SGB2' then error('', 0) end
	local version, key, regbase, flag = s:byte(5, 8)
	if version ~= 1 then error('', 0) end
	local state = bit32.band(key * 257 + regbase * 17 + 0x5EC20, 0xffffffff)
	local plain = {}
	for i = 9, #s do
		state = b_xs(state)
		plain[#plain + 1] = string.char(bit32.bxor(s:byte(i), bit32.band(state, 255)))
	end
	local d = table.concat(plain)
	local p = 1
	local opkey
	opkey, p = b_u32(d, p)
	local root
	root, p = b_u32(d, p)
	local nproto
	nproto, p = b_u32(d, p)
	local g = {
		protos = {},
		enc = flag == 1,
		key = key,
		regbase = regbase,
		opkey = opkey,
		root = root,
		opmap = {},
	}
	for _ = 1, nproto do
		local pid, params, vararg, stack, nbox, maxpc
		pid, p = b_u32(d, p)
		params, p = b_u32(d, p)
		vararg, p = b_u8(d, p)
		stack, p = b_u32(d, p)
		nbox, p = b_u32(d, p)
		local boxed = {}
		for i = 1, nbox do
			boxed[i], p = b_u32(d, p)
		end
		maxpc, p = b_u32(d, p)
		local code = {}
		for pc = 1, maxpc do
			local opcode
			opcode, p = b_u32(d, p)
			local nf
			nf, p = b_u8(d, p)
			local ins = {opcode}
			for _ = 1, nf do
				local fid, val
				fid, p = b_u8(d, p)
				val, p = b_val(d, p)
				if fid == 0 then ins.A = val
				elseif fid == 1 then ins.B = val
				elseif fid == 2 then ins.C = val
				elseif fid == 3 then ins.K1 = val
				elseif fid == 4 then ins.K2 = val
				elseif fid == 5 then ins.K3 = val
				end
			end
			code[pc] = ins
		end
		g.protos[pid] = {
			params = params,
			vararg = vararg ~= 0,
			stack = stack,
			boxed = boxed,
			code = code,
		}
	end
	local nop
	nop, p = b_u32(d, p)
	for _ = 1, nop do
		local encoded, original
		encoded, p = b_u32(d, p)
		original, p = b_u32(d, p)
		g.opmap[encoded] = original
	end
	local hs
	hs, p = b_u8(d, p)
	if hs == 1 then
		for i = 0, 255 do
			local v
			v, p = b_u8(d, p)
			g.sbox = g.sbox or {}
			g.sbox[i] = v
		end
		g.sbox_inv = {}
		for i = 0, 255 do
			local v
			v, p = b_u8(d, p)
			g.sbox_inv[i] = v
		end
	end
	local want
	want, p = b_u32(d, p)
	return g
end

local _P4iytCRkl = {}

function _P4iytCRkl.load(_veXAJeEhc)
	_UHUzdxdY7.protos = _veXAJeEhc.protos
	_UHUzdxdY7.enc = _veXAJeEhc.enc or false
	_UHUzdxdY7.key = _veXAJeEhc.key or 0
	_UHUzdxdY7.opkey = _veXAJeEhc.opkey or 0
	_UHUzdxdY7.opmap = _veXAJeEhc.opmap
	_UHUzdxdY7.sbox_inv = _veXAJeEhc.sbox_inv
	_UHUzdxdY7.regbase = _veXAJeEhc.regbase or 0
	_UHUzdxdY7.cache = {}
	_P4iytCRkl._veXAJeEhc = _veXAJeEhc
	return _P4iytCRkl
end

function _P4iytCRkl._uIXXQgh1P(blob)
	return decode_binary(blob)
end

function _P4iytCRkl._Dv9PfWRXv(...)
	return _UHUzdxdY7._ysnQUTxgF(_P4iytCRkl._veXAJeEhc.root, {}, ...)
end

function _P4iytCRkl._bmHLdYPL2(protos)
	_UHUzdxdY7.protos = protos
end

return _P4iytCRkl

end)()
local __G="5347423201070e01913c6a0976234033e6bf195943391994b50bb4977b3f0f0ae07d618760489a16915d63e5fc77ba8e5637911631bbf29d9be630fc32c5aede31d9e1dcc12c52e58bf1868a775da89e3591c01539b77c42cf3a00ca65d33baf1847dc75e5f22877e3579e38d5c5466360a9fd457babe8f94e2ee5849d45df5cf55c762c8b3cd766a22b21958a64c81aea7cee47a446e97a0f9183c91b3c8d9e9a38de23f92770fc08a37c847a712289bb44cd9770b828ab64b3464ee699a86e6737c92639dfd04e955bdea3272cbc116b4f2703c0a3c9bf0b06fc5516d9cb740e2f2dfe4729e93b8c24379caa80b11aba215cd3e4116c07c08bbead73ee38fde12b45ff7680e5bc81a0d619c7a42c698e6ea85ba99dda4a86c9c2ceaa5746baa24792d581bde0036f298333414af1d1583e5c5adb1d7afe1914577d9732517f5e0703b214f260aacdec39435fa9d8d64481b843f797f5a9eb1aefa89329f613fd6d0594d28f25c10d7c44e4adcafcd6410f7f20a9ce9caec6c0986c6c5dad2bfd7ee4a787f38454b979cf167e002285bad86e37ff8b750ea8484b3dbe9832f74bd6bf10393dcb577903fac9ed68a3dc8321013da74195930e044ee4b1fa05efcccbecbbe3886364381c1e2e21e617af7ebbb2bbdbdfc2a1fdddf1a56399d247c7375e16d15431467c2224d99d5e1dd87ad4fdd0c11a99826f878500c573ed5573d750512fd179411d78798d41bd588f8000d7bf87fe1e6ba138c38143d0ad08cedead1f3df1d85ce99f0764cdb37c5845381d144e3ac732c108c4525a5d0569d13c836b857a2413f0cfd514d151bc460ecd43d72d20f24a3987805ffc0999f9adeab66a93158043a5780abb327fc7859e915fc8a06de34f106cdd3ea1e5a1cf8333042f3408ee1828ab46e3ab523b21191ff6fcb1e61b0742356d7c052f0987642980ada6aa91879230a72063f9027dab0e1af4a93b192664770ec9fb28fef8e3ca7377b13494c6ee14c68b3beb6ee1433d8936abd65943d373ab8cca9c7dbcfcb1f38d9200b881cd57ff2d27e056ac3d021450dd60b27b0435444337bcc6dd4154109216a5caee75d66c149b89e343755501ca56657aace7d1944c887d64e61ccf4588cbf382b9993ae17f21098e7e5f0fc9b72a0c3f54d3471fa493bedca3774b9de5e903a2c7a4abbc1d845833296bace6a50e3653815b20c32a2618fce7155d46e7ebea152c597c0960ce23157e6a05744315f5b08f39ba3cc1370ff61dcc4c64cccbc0bb486ea66d0aaab6a8ea57b1fc698e1568339945ddc9694a0b5059f10e97142ee1ea7e8c55aaa57c3947c9e41d5068fca37815912e5449c3c77b0331fe3eb6a3cd54651102eeb0caf5ec434fc2b6247bc5fcd2b507d0b60b8562a12787293d1302ec325e474ddfcdd9e0ce7a8719994de7dfae92a1f50d0dbbf9b7aa3ee55ae31f525bd5d4993af07972ebeb56bb95a825c8c992cbb2d3aeecd20743be197ad3f468cdb267a15cdcba6a0373599d4794fe4be1430b54004628d6ac9ff0bd02b83c5672c598f84499d115dd4bf15a3f1b545c483d77c565071efa21d812ed8d81d122c13dd85a010825939296e07e3054fd01177bdec5e570728dd33d90ae19fe65f0f6a6b5000fadd5a9c19703c8ae46906d03d4c0d74ec9fbbbda70cfb1c1b00760dc19f2282c99c0fb54d96f80c12821efb0043fd4b0ff0987693124b2c4fea5ffa0179d2892e17c7832b784f6115aa07fc482dc2ececf6ab60cbd08c013fd069687c8e546f63ecc12c208be614483d6d52fc9707a6fdfe69e37d796aa362e13cbbbcc312ad24e4c11cb18233ee6d981450b6471587fbe5a8ee739a1759484d02ca63769a1cbfda3b4a383479a3c5a4714a32ce7541333ea24b6105d8b966d76cd876218e675e5fd16a7625ec18d2c35261a4f4ef877705f025b06457a9b772af62397066cd7c8cbbb4bd362f8c910ffced81a3b1b5a6a91468861334f056d650edb1aac42545cfd6221e98f7861aaac7e0b7f0244e3bfc648571c8b7a9bca36895a230bad7f23b42b18e7985d2502314476bc4230acd5e925af3d8f498e1c8305559f952768984db670c0141f2428868bf87f4bb5b403971d1f748c0486f8391eecd392d325da7448bbce5a9043f326d20a12a5f814800445d33e22c6996ebc3b3a9b91d94af9bed1a089fb14094ea96cd3e99b49a9c144dc6bf7b167ed6aed8375f87a8eec741ed65874b6e473130e18a9bbe7995b7928667ddb97798603594161f1555e3237398f0b05c25f5fba70dfb41a74d44574625ec1d41ff75887dfbf0626d0a15d6911348fd0b89b7f3f62aa986a469ccbf86ea8ed7ff62b096b87dc8a2d567d446b64ca8e605b5557a64f04d140e850926f457768003461cbb08e66af05f506759e8360a8373cdd0885d71773c589ec09ab656f245c3291341cc5ffa30b850836715d6a7f9a9b22bde0bdf799763355ccec954f017c228aa8c00d74993ac64768eaccb999dfbcbfd4fdf672d9aa88204b050c07f686d6b47d7dc66813c264284effc505af4bb8b323c4e05716c6d7850e78f66e6b8673bca2ae2d97d5f38dd646903423f93df09768510d7236d14d53993a0ba37f5a01596b061875b3ecefae9b11a681b139f4cdf6b7db14a45bdb153cc49320aeadbb90bbd4dfb210a8dcb35ece6d6b88b101e92178e57b827db71d818464dec52d5bb79d50671da46162273be6a32490a5429745ac18d914be9161955d58010ac8e0543263edcfc5c4a42d892c03eb0a13c866626610ec206f41b5ac8a46128c3f36127e4fd5fd91559145a3f39fd449026328a030a24d950fb5843eb9c5f6a4b9edec33443e6f6cec80730607a078c202a3c5626f278d283f67aae5d61a70a451f86a01cedbc109396459ba938351e7d18cdbd6e83450ff723aa8d87d6b4b273bb421eb34d1d7b3fd9eb5ea956554142ada011219c079799f2dfb8a50c262a03ef701083fdede8bcd9267032059cd05d080e1a176ec7584f115d6974caaa55185870fdf1dcfce7d1ba2dd0074ded4a24a8903d09484fb04fff4e6af86732d173a3b6c17dbb1b59abda13532810c474abab1a3e80513dbf1c24bebaf1bad2e698b25f4bc13d20b3fbd35a209a1b6b5d1ab52fe3f23fb5bff2cbe3d2cdfe13a68f729c0be3d0f7b38aa1f1c5258e3d59cb0e2099df501b0d38327066a5af347599f33c60de78bc04572aaafa770b92da4c4b20dfa0e79f7e9d980d078c39e397abebc33819535a6a9b196be4dadf26d385e35ab2418528d6e9adbd568db150b08c1e14c418c0b0c831ce0c0e27b95aeca4a142603f1a2cd2b429ba17e4abd3d92a3f05c1ab15eb42bf0dadb026ef3204fea51b8b81daf7c67296ed11991"
return _ssssssssss.load(_ssssssssss.decode(__G))._Dv9PfWRXv()