Hex-agony #2 II: Four Blacks Around a Green

The board is a hexagon of 37 hexes, arranged in 7 columns of 4, 5, 6, 7, 6, 5 and 4 hexes.
Two numbers are given, both in the middle column: a blue 28561 in its top hex and a
green 1 in the hex directly below it.

Write non-negative integers, each coloured red, blue, green or black, in some (perhaps not all) of the other hexes so that every number on the board, including the two given ones, obeys its colour's rule:

1. Each red number equals the sum of the blue numbers in its view.
2. Each blue number equals the maximum of the green numbers in its view (or 0 if it sees no green).
3. Each green number equals the product of the black numbers in its view (or 1 if it sees no black).
4. Each black number equals the number of red numbers in its view.

A hex's view is every other hex in the same column or on either of the two diagonals through it (a diagonal steps one column left or right and half a hex up or down at each step, as in the diagram, and runs all the way to the edge of the board).
Nothing blocks the view, and empty hexes count for nothing.

Answer format: a single integer, the largest possible sum of all the numbers in the middle column (the column of 7 hexes), including the two given numbers; empty hexes count as 0.