AMALOG is a simple, Prolog-like, logic programming language.You, the user / programmer, will describe the problem, and the Amalog interpreter will try to solve it. This is called the "declarative" paradigm.
See inside for examples, and to give it a try!
Questions / remarks: go to the "Logic programmning" topic in the Snap! forum.
v1: Feb. 2, 2024;
v1.1: Feb. 3, 2024 (error corrections);
v1.2 , Feb. 5, 2024 (mechanisms for memoizing results, and to prevent infimite loops);
v1.3, Feb. 6, 2024 (error corrections);
v1.4, Feb. 9, 2024 (Amalog block, tutorial);
v1.5, Feb. 10, 2024 (refinements).data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAKAAAAB4CAYAAAB1ovlvAAAAAXNSR0IArs4c6QAAAERlWElmTU0AKgAAAAgAAYdpAAQAAAABAAAAGgAAAAAAA6ABAAMAAAABAAEAAKACAAQAAAABAAAAoKADAAQAAAABAAAAeAAAAAAeaS0RAAAGb0lEQVR4Ae2dX0hddRzAvzYbumI1tszCsExiF3QNasswC0zHZjZDa7p7CzUf2iKQBRH00nyoHoIKe6iXmNQwROxhtIfAh4hZD7XYg9CfIeSiqJnZ7NbSTe0eV+rVa8zvvt3fPff3uSDcc879fs/v+/l+OOd3zpVzc+YSL+EFAUcErnK0X3YLgXkCCIgITgkgoFP87BwBccApAQR0ip+dIyAOOCWQdgGHh4edFhymnQesut7ql573esM07DWNNe0CXv3bqDx/V470vdgu777WJePj42sasE8fLisrk03rL0r7q8ckp+wx2VYbk643j8rQ0FDWYMhxcSP65UPtcu3JngWIX/+xQaJPHZLvc4tk/5MHFtbz5hKB2qZ2GTx9PhnHdFyad90jkVtvlI59dVJUVJS8PSRLaT8CBlxeeP2IfH52kdDWa/6UL4++JGM9B+WNqhxpadizuJF3qxKYk/B/iZW7anX/44bgCLijYHEHX8XzJHbgWTmzrkiiHQcXN/BOut95/9LRb3ZGym9aL01790j19mKpqqrKCjppF/CbE8fl3Cc9UlLfKtPX3SYPtT4jmzdvzgqY1kUEFyET07ly5LmHpe2JmHX6jMiX9jlgADWYXPOCQEAg7QKCHQJLCTi5CFk6AN77TQAB/e6/8+oR0HkL/B4AAvrdf+fVI6DzFvg9AAT0u//Oq0dA5y3wewAI6Hf/nVePgM5b4PcAENDv/juvHgGdt8DvASCg3/13Xj0COm+B3wNAQL/777x6BHTeAr8HgIB+99959QjovAV+DwAB/e6/8+oR0HkL/B4AAvrdf+fVI6DzFvg9AAT0u//Oq0dA5y3wewAI6Hf/nVef9kdzWFQcPF3h2x8G5K+JYom2tFmkJIcjAqF9MkLfB93y4aedMnNRJHe6XHbXNklxQY1UVlY6QsluNQRCK2BQbMfTtTK9YTCp7t8nRHZua5aCTRHZXd0R2ufmJRWVxQtZOQfMhufmZbFzSaWFcg4YVBCcgoOj3/wpeCpxCt7VJLdsqc6a5+YldSmLF0J5Cl64CPk1cRGyvy2L25P9pYVSwExrC8881HcEAfXskiKPP75TTp4Zk73RNhktKJeGxsak7SykJoCAqbmsee3IyIj0NWyVO/IS94USr3MXRGa310jJ3ffJzTX7JBKJrDmnDwEIaNjlt1/pki0Dh1Nm/Ggscduo7zOpqKhIud3XlQho1PlUR8CZOx+U23dUOTsCBnPTgbxfpPjUz9L2aLNRpbZpENCIZzAH/GL0rDTE2uW7gjJ5pLHJKPOVpen++Jh0Tp0Smbog5afj0vRAjdRMXZ8x3xgh4JX1dz4606+Caw93yuC9y34K48dxab4hIpF1G6Wj/H5n3xhl5TchBk6tKUVYf3ZiLgN+aIkj4JpUC9+HU52Cq89vzJhvjBAwfE5d9ogXL0J+SlyEtFx2XDo/iIDppM2+VhBgDrgCCSvSSQAB00mbfa0gENp/x1pRieGKYO4U/M3Ozko0GjXMTKrlBJgDLifyz3Jvb6/09/fLzMyM5OfnS11dnZSWlmbMDdxVhh261Qj4Hy1rbW2VycnJpE/E4/F5CQsLC6W+vt7ZDdykQYV4gTmgonlzmXAHVzHuTAxhDrhKV4JTcHD0W3oKLikpyZgbuKsMO3SrOQWnaNm/FyGBfLFYLMUnWGVFAAGtSJJHRYA5oAobQVYEENCKJHlUBBBQhY0gKwIIaEWSPCoCCKjCRpAVAQS0IkkeFQEEVGEjyIoAAlqRJI+KAAKqsBFkRQABrUiSR0UAAVXYCLIigIBWJMmjIoCAKmwEWRFAQCuS5FERQEAVNoKsCCCgFUnyqAggoAobQVYEENCKJHlUBBBQhY0gKwIIaEWSPCoCCKjCRpAVAQS0IkkeFQEEVGEjyIoAAlqRJI+KAAKqsBFkRQABrUiSR0UAAVXYCLIigIBWJMmjIoCAKmwEWRFAQCuS5FERQEAVNoKsCCCgFUnyqAggoAobQVYEENCKJHlUBBBQhY0gKwIIaEWSPCoCCKjCRpAVAQS0IkkeFQEEVGEjyIoAAlqRJI+KAAKqsBFkRQABrUiSR0UAAVXYCLIigIBWJMmjIoCAKmwEWRFAQCuS5FERQEAVNoKsCCCgFUnyqAggoAobQVYEENCKJHlUBBBQhY0gKwIIaEWSPCoCCKjCRpAVAQS0IkkeFQEEVGEjyIrA3z3gYye9tfRNAAAAAElFTkSuQmCCAMALOG is a simple, Prolog-like, logic programming language.You, the user / programmer, will describe the problem, and the Amalog interpreter will try to solve it. This is called the "declarative" paradigm.
See inside for examples, and to give it a try!
Questions / remarks: go to the "Logic programmning" topic in the Snap! forum.
v1: Feb. 2, 2024;
v1.1: Feb. 3, 2024 (error corrections);
v1.2 , Feb. 5, 2024 (mechanisms for memoizing results, and to prevent infimite loops);
v1.3, Feb. 6, 2024 (error corrections);
v1.4, Feb. 9, 2024 (Amalog block, tutorial);
v1.5, Feb. 10, 2024 (refinements).A container for goals.
Use as "input list" only!updated 1st goal1resultssolutionGenerate all valid solutions for a goal.
INPUT
1. Goal = list of 1 or more items. Each item may be a variable or a constant.
2. Database of clauses.
OUTPUT
List of solutions (0, 1 or more).
Any solution will meet all goals.
Any solution has the same number of items as the goal.typefunctionrelevant clausessolutionsclauseresultsMemoize search results.regoalresultsReports the head, type or tail of a clause.
HOW
A clause has a head (list) and a tail (list of lists).
If the head's first item (functor) is a Snap! script, type = function. Else, if the tail is empty, type = fact. Else, type = rule.
headhead
type
tailtypetailNo such attribute: Evaluate a function using a Snap! script (reporter or predicate)
INPUT list
1. Snap! function
2..(n-1). Arguments
n. may be anything
OUTPUT list
1..(n-1) same as input
n. Result
EXAMPLE
EVALUATE FUNCTION ([+], 2, 3, ?r) => ([+], 2, 3, 5)
If however the script is a command, it is executed like above, and TRUE is returned.1kv-pair2To be used as a goal within a rule’s body. Stops further execution of the body; an empty list (or false) will be reported.May be used as a placeholder for a fact or rule within a clause list. Has no effect on program’s resultsMay be used as a placeholder for a goal within a rule’s body. Has no effect on program’s results1The second input is an "association list," a list of two-item lists. Each of those smaller lists has a "key" as its first item and a "value" as its second. ASSOC reports the first key-value pair in the association list whose key matches the first input.ca:associació _ _
This block carries out the given script for each item of the given list, like the primitive FOR EACH.
What's different is that it provides the # variable, which will contain the item number in the list of each item in turn, 1 while processing item 1, and so on.ca:_ per cada _ de _ _
SENTENCE is the main constructor for sentences, represented
as lists of words. It takes zero or more inputs, each of which can
be either a list or a text string. If a list, the input is assumed to be
a list of words. If a text string, it is converted to a list of words using
SENTENCE→LIST. Then all the lists of words are appended to form a new list of words.
If the inputs are lists of lists rather than lists of words, SENTENCE,
like APPEND, does only one level of flattening, reporting a list of
all the items of all the input lists.ca:frase _
ZIP takes any number of lists as inputs. The lists should all be the same length. ZIP reports a list of lists in which the first item is a list of all the first items, the second item is a list of all the second items, etc.
Viewing the inputs as the rows of a matrix, ZIP reports its transpose.Takes a sentence in text string form and reports the sentence as a list of its words.de:Satz $arrowRight Liste _
ca:frase $arrowRight llista _
es:frase $arrowRight lista _
fr:phrase $arrowRight liste _
pt:uma lista com as palavras da frase _
The first input is a shape list as in
SHAPE OF. The output is an array with those dimensions containing the atomic items of the second input,
repeating values if more are needed.Reports a flat list of the maximum size of the input array along
each dimension: number of rows, number of columns, etc.
"Maximum" because it works even if the array isn't uniformly shaped.Reports the greater of its two inputs. Works on strings too.Reports a flat list of all the atomic elements
of sublists of the input list.Reports the number of dimensions of the input.111Takes a multidimensional array, and
reports an array whose dimensions
are reversed (as reported by
SHAPE OF). In the case of a
two-dimensional array, does the usual transposition of rows and columns.Reverses the order of the (toplevel) items of the input.
If the input is a matrix, this means it reverses the order of the rows, which is a reflection through a horizontal axis, as the ⦵ symbol suggests.Like MAP, but can take any number of lists
as inputs. The lists must all be the same size.
The function input must take a number of inputs
equal to the number of lists. MULTIMAP calls
the function with all the first items, then all the
second items, and so on.colsComputes a generalized matrix multiplication.
In normal matrix multiplication, each cell of the result
is computed by multiplying individual numbers within
a row of the left input and a column of the right input,
and then adding those products. In APL terms this is
+.× ("plus dot times")
Any dyadic functions can replace addition and multiplication in this algorithm; a common case is
∨.∧ ("or dot and")111111Reports the smaller of its two inputs.This function has two names because there are two ways
to understand it.
Lisp way: A matrix is a list of rows. This block combines the numbers in each row, producing one value for the entire row.
APL way: A matrix is made of vectors. This block takes each column as a vector, and does vector arithmetic on the columns, producing one column as the result.choicesindexchoicesReports 1 if the input is positive,
0 if the input is zero,
or -1 if the input is negative.0falsereports 1 divided
by its input.This block reports a random integer between 1 and its input. To roll more than one die, use (for three dice)
roll (reshape as 3 items of 6)
APL: ?3⍴6
Don't use reshape as 3 items of (roll 6), because that would roll one die and report 3 copies of the same random roll. Reports True if the input is an APL scalar,
i.e., either an atomic (non-list) value, or
an array (list of lists) of any depth with only
one atomic item, e.g., (list (list (list (3)))).1The input must be a value for which SCALAR? reports true, i.e., either an atom or a list of any depth but only one scalar item of item of... etc. This function returns the underlying scalar (number, etc.).1Reports the not-and of its inputs, in the form
0 for false, 1 for true.Reports the not-and of its inputs, in the form
0 for false, 1 for true.Reports True if the left input is
less than or equal to the right input.
Reports a Snap! Boolean, not an integer 0 or 1.Reports True if the left input is
greater than than or equal to
the right input.
Reports a Snap! Boolean, not an integer 0 or 1.Reports False if its inputs are equal;
reports True if its inputs are not equal.
The inputs can have any non-list values.
(Lists are hyperized.) If the inputs are
Booleans (True/False or 1/0), this is
also the exclusive-or function.reports True iff the input is 0 or False.Reports a Snap! Boolean False if the input
is False or 0; reports True otherwise.0Turns list of list of ... a single scalar (e.g., ((((x)))) ) into just the scalar. Error if called with anything else.Make scalar called with non-singleton input If the input is a positive integer, reports a list of the numbers
from 1 to that input. (If the input is 0, reports an empty list.)
If the input is a list of positive integers, reports an array with
the shape specified by the input (as in ⍴ reshape) in which
each item is a list of the indices of that item in the array
(so technically the shape has one more dimension
than the input, whose size is the size of the input).
If the input is a list that includes 0, the result is an array whose shape is the part of the input list before the 0, in which every element is empty. If you'd like some other value in every element, MD-MAP a constant function over the result.
For list inputs, the size of the result grows very quickly, more or less the factorial of the size of the input. Snap! will not attempt to compute a result bigger than a few million atomic items.
⍳(⍳ 9) will work (≈ 3 million atoms) but ⍳(⍳ 10) will give an error.If the rank of the left input is one more than the rank of the right input,
reports the index of the right input in the left input, or if not found,
reports one more than the length of the left input.
If the rank of the left input is equal to the rank of the right input,
reports a vector of the indices of the items of the right input
in the left input (mapping this function over the right input).
If the rank of the left input is more than that of the right input by 2 or more,
reports a vector, the location of the right input in the left in each dimension.
It is an error if the rank of the left input is less than that of the right input.1resultThis isn't an APL function, although it's related to the outer product.
It takes any number of lists, and reports a list of all possible tuples with one item from each of the lists. The length of the result is the product of the lengths of the inputs.
The result gets very big very quickly. Snap! will refuse to do this computation if the result would be more than a few million atomic items. (crossproduct (⍳(⍳9))) makes about 3 million atomic items; (crossproduct (⍳(⍳10))) gives an error message.Reports an array of Booleans the same shape
as the left input, indicating which of the atoms
in the left input appear anywhere in the right
input.
(The structure of the right input doesn't matter.)Like append, but:
A scalar input is treated as an array the same shape as the other input except that the last item of the shape is 1.
If the two inputs are of different ranks,
the function is mapped over the larger ranked input.
Catenate adds new columns, by appending to each row.If the input is a nesting of length=1 lists, which
APL treats as a scalar (the innermost item)
for many purposes, report that innermost scalar.
Otherwise, report the input as is.
Exposing this block for users is important because Snap! /does not/ treat such a nesting
as a scalar, so you might need to use this in
translating an APL program to Snap!.
(But the functions in the APL library already use
this block as needed.)Reports a vector of indices of the items of the input, in order of the values of the items, so that
item (grade up (foo)) of (foo)
reports the items in sorted order, smallest to largest. For a matrix, sorts the rows based on their first items, or if those are equal, based on their second items, etc.Compares two vectors for sorting.
Compare first items; if those are equal compare second items; etc.1111Reports a vector of indices of the items of the input, in order of the values of the items, so that
item (grade down (foo)) of (foo)
reports the items in sorted order, largest to smallest. For a matrix, sorts the rows based on their first items, or if those are equal, based on their second items, etc.The left input must be a vector of Booleans
(either Snap! form or APL form); the right input must be an array whose first dimension is equal to the length of the left input. The block reports an array of the same rank as the right input, containing only those items (rows, for a matrix) for which the corresponding Boolean is True (or 1).The left input must be a vector of Booleans
(either Snap! form or APL form); the right input must be an array whose last dimension is equal to the length of the left input. The block reports an array of the same rank as the right input, containing only those items (columns, for a matrix) for which the corresponding Boolean is True (or 1).Turns a row-wise (in Lisp terminology) function
into a column-wise one.Reverses the order of the columns of the input, which is a reflection through a vertical axis, as the ⏀ symbol suggests.This function has two names because there are two ways
to understand it.
Lisp way: A matrix is a list of rows. This block turns it into a list of columns, and combines the numbers in each column, producing one value for the entire column.
APL way: A matrix is made of vectors. This block takes each row as a vector, and does vector arithmetic on the rows, producing one row as the result.Like append, but:
A scalar input is treated as a vector
of length 1.
If the two inputs are of different ranks,
the function is mapped over the larger ranked input.
Catenate vertically adds new rows, by appending to each column.A hyperblock version of JOIN. The regular JOIN isn't hyperized because it can accept a list as input, representing it as text.A positive left input selects the first n items of the right input.
A negative left input selects the last abs(n) items
of the right input.
If the right input is a matrix, a numeric left input selects rows;
the left input may also be a two-item vector, in which case
the first number is applied to the rows
and the second number is applied to the columns.
Similarly for higher-dimension arrays. 10valueindexA positive left input selects all but the first n items of the right input.
A negative left input selects all but the last abs(n) items
of the right input.
If the right input is a matrix, a numeric left input selects rows;
the left input may also be a two-item vector, in which case
the first number is applied to the rows
and the second number is applied to the columns.
Similarly for higher-dimension arrays. 0valueindexThrow an error.
Makes a red halo appear around the script that runs it,
with the input text shown in a speech balloon next to
the script, just like any Snap! error.
This is useful to put in the second script of SAFELY TRY
after some other instructions to undo the partial work of
the first script.pt:lança o erro _
Reports a sorted version of the list in its first input slot, using the comparison function in the second input slot. For a list of numbers, using < as the comparison function will sort from low to high; using > will sort from high to low.ca:ordena _ segons criteri _
copy of datasplitmerge11#1#21Takes a (possibly deep) list as input,
and reports a human-readable text form
of the list (namely, Lisp notation).
Will not work on circular lists.()The identity function reports its input.Takes as input a function of N inputs and N lists.
The function is called with item 1 of all the lists as its inputs, with item 2 of all the lists as its inputs, and so on. (The lists should all be the same length.)Takes a dyadic scalar function as input, and
hyperizes it, so that it can take lists as inputs.
Don't use on slow functions (this has compiled map calls). Meant for use on primitives.abComputes logarithms in any base.
The base is the left input. It's usual in APL that if there's a main data input and some sort of control input, the latter comes on the left. This is because APL syntax, unless you use parentheses, groups computations from right to left.
APL has a monadic version of this function that computes natural logs (log to the base e).Computes the number of combinations of right-input things taken left-input at a time, otherwise known as the elements of Pascal's triangle. This block shares the ! symbol with the monadic factorial function, because the formula for computing this function uses factorials.The factorial of a positive integer n is the product of the integers from 1 to n.
In real APL, the domain of this function is extended beyond integers to compute the gamma function.Acts just like the function selected from
the pulldown menu, but hyperized, so
comparing two equal-sized lists reports
a list of the same length as the inputs,
with the results of item-by-item comparisons.﹦﹦
≠
identical to
and
or
is _ a _?Reports the greatest common divisor of its inputs.
If the inputs are values in {0,1} then this is equivalent to the logical OR of the values, with 0=False, 1=True. Hence the APL symbol ∨.
Also accepts Snap! Booleans as inputs.Reports the least common multiple of its inputs.
If the inputs are values in {0,1} then this is equivalent to the logical AND of the values, with 0=False, 1=True. Hence the APL symbol ∧.
Also accepts Snap! Booleans as inputs.Reports 1 if the input is False or 0;
otherwise reports 0.Reports its input.
This is useful to fit a value into a different-type input slot, e.g., number into list slot.Report a list with left-input random integers in the range 1 to right-input.
No number appears more than once
in the result. The left input must be less than or equal to the right input.Given two arrays A and B, reports an array whose dimensions are
APPEND(SHAPE OF (A), SHAPE OF (B))
in which each atomic item of the result is computed by applying the dyadic function input to an item of A and an item of B.11data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAeAAAAFoCAYAAACPNyggAAAAAXNSR0IArs4c6QAAAERlWElmTU0AKgAAAAgAAYdpAAQAAAABAAAAGgAAAAAAA6ABAAMAAAABAAEAAKACAAQAAAABAAAB4KADAAQAAAABAAABaAAAAAAHwbojAAAL30lEQVR4Ae3QMQEAAADCoPVPbQwfiEBhwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGDBgwIABAwYMGPgMDI3+AAEeFvcCAAAAAElFTkSuQmCC?xtrueshow person?xperson?x1?xTshow person?a