Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number bi. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!Your task is to write a program which calculates two things:  The maximum beauty difference of flowers that Pashmak can give to Parmida.  The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.

The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers b1, b2, ..., bn (1 ≤ bi ≤ 109).

The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.

NoteIn the third sample the maximum beauty difference is 2 and there are 4 ways to do this:  choosing the first and the second flowers;  choosing the first and the fifth flowers;  choosing the fourth and the second flowers;  choosing the fourth and the fifth flowers.

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	var n int
	fmt.Scanf("%d \n", &n)

	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')
	list := strings.Split(strings.TrimRight(line, "\r\n"), " ")

	min := 1000000001
	max := 0
	cmin := 0
	cmax := 0
	for i := 0; i < n; i++ {
		temp, _ := strconv.Atoi(list[i])
		t := int(temp)
		if t < min {
			min = t
			cmin = 0
		}
		if t > max {
			max = t
			cmax = 0
		}
		if t == min {
			cmin++
		}
		if t == max {
			cmax++
		}
	}
	d := max - min
	c := int64(cmax) * int64(cmin)
	if d == 0 {
		c = (int64(cmax) * int64(cmax-1)) / int64(2)
	}
	fmt.Println(d, c)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max, min := numbers[0], numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	maxGap := max - min
	var pairCount int64
	if maxGap != 0 {
		pairCount = int64(numberCount[max]) * int64(numberCount[min])
	} else {
		pairCount = int64(n) * int64(n-1) / 2
	}

	fmt.Println(maxGap, pairCount)

}

package main

import (
	"bufio"
	"bytes"
	"errors"
	"flag"
	"fmt"
	"io"
	"log"
	"os"
	"runtime/pprof"
	"strconv"
	"time"
	"unicode/utf8"
)

// ******************************** CODE STARTS ********************************

var ()

func solve() {
	n := readInt()
	minCount := 0
	minValue := -1
	maxCount := 0
	maxValue := -1
	for i := 0; i < n; i++ {
		value := readInt()
		if value == minValue {
			minCount++
		}
		if value == maxValue {
			maxCount++
		}
		if minValue == -1 || minValue > value {
			minValue = value
			minCount = 1
		}
		if maxValue == -1 || maxValue < value {
			maxValue = value
			maxCount = 1
		}
	}
	printInt(maxValue - minValue)
	printString(" ")
	if minValue == maxValue {
		printInt64(int64(minCount) * int64(minCount - 1) / 2)
	} else {
		printInt64(int64(minCount) * int64(maxCount))
	}
	printLine()
}

// ********************************* CODE ENDS *********************************

// IO.

var (
	scanner *Scanner
	writer  *bufio.Writer
	logger  *log.Logger
)

func main() {
	dbg := flag.Bool("dbg", false, "Equals true, if run is in debug mode.")
	opt := flag.Bool("opt", false, "Equals true, if run is in optimized mode.")
	flag.Parse()

	var (
		input  *os.File
		output *os.File
	)

	if *opt || *dbg {
		startTime := time.Now()
		defer func() {
			println(fmt.Sprintf("Time: %.5fs", time.Since(startTime).Seconds()))
		}()
		input, _ = os.Open("/home/outside/coding/workspace/go/io/input.txt")
		output, _ = os.Create("/home/outside/coding/workspace/go/io/output.txt")
		logger = log.New(output, "log: ", 0)
		if *dbg {
			cpuprofile, _ := os.Create("/home/outside/coding/workspace/go/io/cpuprofile.txt")
			pprof.StartCPUProfile(cpuprofile)
			defer cpuprofile.Close()
			defer pprof.StopCPUProfile()
		}
	} else {
		input = os.Stdin
		output = os.Stdout
		// input, _ = os.Open("")
		// output, _ = os.Create("")
	}
	defer input.Close()
	defer output.Close()

	scanner = NewScanner(input)
	scanner.Split(bufio.ScanWords)

	writer = bufio.NewWriter(output)
	defer writer.Flush()

	solve()
}

// Read.

func readString() string {
	scanner.Scan()
	ans := scanner.Text()
	return ans
}

func readLine() string {
	scanner.Split(bufio.ScanLines)
	defer scanner.Split(bufio.ScanWords)
	return readString()
}

func readInt() int {
	ans, _ := strconv.ParseInt(readString(), 10, 0)
	return int(ans)
}

func readInt64() int64 {
	ans, _ := strconv.ParseInt(readString(), 10, 64)
	return ans
}

func readFloat64() float64 {
	ans, _ := strconv.ParseFloat(readString(), 64)
	return ans
}

// Write.

func printString(value string) {
	writer.WriteString(value)
}

func printLine() {
	printString("\n")
}

func printInt(value int) {
	printString(strconv.FormatInt(int64(value), 10))
}

func printInt64(value int64) {
	printString(strconv.FormatInt(value, 10))
}

func printFLoat64(value float64) {
	printString(strconv.FormatFloat(value, 'f', 20, 64))
}

// Log.

func logln(value ...interface{}) {
	writer.Flush()
	logger.Println(value...)
}
func logf(format string, value ...interface{}) {
	writer.Flush()
	logger.Printf(format, value...)
}

// Tuple

type Tuple struct {
	a, b int
}

func (p Tuple) Equals(key Key) bool {
	return p.a == key.(Tuple).a
}

func (p Tuple) Less(key Key) bool {
	return p.a < key.(Tuple).a
}

type TupleSlice []Tuple

func (p TupleSlice) Len() int {
	return len(p)
}

func (p TupleSlice) Less(j, i int) bool {
	return p[j].a < p[i].a
}

func (p TupleSlice) Swap(j, i int) {
	p[j], p[i] = p[i], p[j]
}

// Min, max, abs.

func maxInt(a, b int) int {
	if a > b {
		return a
	} else {
		return b
	}
}

func minInt(a, b int) int {
	if a < b {
		return a
	} else {
		return b
	}
}

func absInt(a int) int {
	if a > 0 {
		return a
	} else {
		return -a
	}
}

func maxInt64(a, b int64) int64 {
	if a > b {
		return a
	} else {
		return b
	}
}

func minInt64(a, b int64) int64 {
	if a < b {
		return a
	} else {
		return b
	}
}

func absInt64(a int64) int64 {
	if a > 0 {
		return a
	} else {
		return -a
	}
}

func maxFloat64(a, b float64) float64 {
	if a > b {
		return a
	} else {
		return b
	}
}

func minFloat64(a, b float64) float64 {
	if a < b {
		return a
	} else {
		return b
	}
}

func absFloat64(a float64) float64 {
	if a > 0 {
		return a
	} else {
		return -a
	}
}

// Set Key interface implementations.

type Int int

func (p Int) Equals(key Key) bool {
	return int(p) == int(key.(Int))
}

func (p Int) Less(key Key) bool {
	return int(p) < int(key.(Int))
}

// Set.

type Key interface {
	Equals(key Key) bool
	Less(key Key) bool
}

type node struct {
	key   Key
	left  *node
	right *node
}

func newNode(key Key) *node {
	return &node{key, nil, nil}
}

type SplayTree struct {
	root *node
	tmp  *node
	len  int
}

func NewSplayTree() *SplayTree {
	return &SplayTree{nil, newNode(nil), 0}
}

func rotateLeft(x, p *node) {
	p.right = x.left
	x.left = p
}

func rotateRight(x, p *node) {
	p.left = x.right
	x.right = p
}

func (p *SplayTree) splay(x *node, key Key) *node {
	if x == nil {
		return nil
	}

	left := p.tmp
	right := p.tmp

	for {
		if key.Less(x.key) {
			y := x.left
			if y == nil {
				break
			}
			if key.Less(y.key) { // zig-zig
				rotateRight(y, x)
				x = y
				if x.left == nil {
					break
				}
			}
			// link right
			right.left = x
			right = x
			// move left
			x = x.left
		} else if x.key.Less(key) {
			y := x.right
			if y == nil {
				break
			}
			if y.key.Less(key) { // zig-zig
				rotateLeft(y, x)
				x = y
				if x.right == nil {
					break
				}
			}
			// link left
			left.right = x
			left = x
			// move right
			x = x.right
		} else {
			break
		}
	}

	left.right = x.left
	right.left = x.right
	x.left = p.tmp.right
	x.right = p.tmp.left

	return x
}

// left <= key < right
func (p *SplayTree) split(key Key) (left, right *node) {
	p.root = p.splay(p.root, key)
	if p.root.key.Equals(key) || p.root.key.Less(key) {
		right := p.root.right
		p.root.right = nil
		return p.root, right
	} else {
		left := p.root.left
		p.root.left = nil
		return left, p.root
	}
}

// keys from left tree must be less then keys from right tree
func (p *SplayTree) join(left, right *node) *node {
	if left == nil {
		return right
	} else if right == nil {
		return left
	}
	left = p.splay(left, right.key)
	left.right = right
	return left
}

type Set interface {
	Len() int
	Insert(key Key) error
	Find(key Key) bool
	Remove(key Key) error
}

func NewSet() Set {
	return Set(NewSplayTree())
}

func (p *SplayTree) Len() int {
	return p.len
}

func (p *SplayTree) Insert(key Key) error {
	if p.root == nil {
		p.root = newNode(key)
		p.len++
	} else {
		p.root = p.splay(p.root, key)
		if p.root.key.Equals(key) {
			return errors.New("Such key already exists")
		} else {
			left, right := p.split(key)
			p.root = newNode(key)
			p.root.left = left
			p.root.right = right
			p.len++
		}
	}
	return nil
}

func (p *SplayTree) Find(key Key) bool {
	if p.root == nil {
		return false
	}
	p.root = p.splay(p.root, key)
	return p.root.key.Equals(key)
}

func (p *SplayTree) Remove(key Key) error {
	p.root = p.splay(p.root, key)
	if p.root == nil || !p.root.key.Equals(key) {
		return errors.New("Such key doesn't exist")
	}
	p.root = p.join(p.split(key))
	return nil
}

// Copied scan.go
// Scanner provides a convenient interface for reading data such as
// a file of newline-delimited lines of text. Successive calls to
// the Scan method will step through the 'tokens' of a file, skipping
// the bytes between the tokens. The specification of a token is
// defined by a split function of type SplitFunc; the default split
// function breaks the input into lines with line termination stripped. Split
// functions are defined in this package for scanning a file into
// lines, bytes, UTF-8-encoded runes, and space-delimited words. The
// client may instead provide a custom split function.
//
// Scanning stops unrecoverably at EOF, the first I/O error, or a token too
// large to fit in the buffer. When a scan stops, the reader may have
// advanced arbitrarily far past the last token. Programs that need more
// control over error handling or large tokens, or must run sequential scans
// on a reader, should use bufio.Reader instead.
//
type Scanner struct {
	r            io.Reader // The reader provided by the client.
	split        SplitFunc // The function to split the tokens.
	maxTokenSize int       // Maximum size of a token; modified by tests.
	token        []byte    // Last token returned by split.
	buf          []byte    // Buffer used as argument to split.
	start        int       // First non-processed byte in buf.
	end          int       // End of data in buf.
	err          error     // Sticky error.
}

// SplitFunc is the signature of the split function used to tokenize the
// input. The arguments are an initial substring of the remaining unprocessed
// data and a flag, atEOF, that reports whether the Reader has no more data
// to give. The return values are the number of bytes to advance the input
// and the next token to return to the user, plus an error, if any. If the
// data does not yet hold a complete token, for instance if it has no newline
// while scanning lines, SplitFunc can return (0, nil, nil) to signal the
// Scanner to read more data into the slice and try again with a longer slice
// starting at the same point in the input.
//
// If the returned error is non-nil, scanning stops and the error
// is returned to the client.
//
// The function is never called with an empty data slice unless atEOF
// is true. If atEOF is true, however, data may be non-empty and,
// as always, holds unprocessed text.
type SplitFunc func(data []byte, atEOF bool) (advance int, token []byte, err error)

// Errors returned by Scanner.
var (
	ErrTooLong         = errors.New("bufio.Scanner: token too long")
	ErrNegativeAdvance = errors.New("bufio.Scanner: SplitFunc returns negative advance count")
	ErrAdvanceTooFar   = errors.New("bufio.Scanner: SplitFunc returns advance count beyond input")
)

const (
	// Maximum size used to buffer a token. The actual maximum token size
	// may be smaller as the buffer may need to include, for instance, a newline.
	MaxScanTokenSize = 1 << 20
)

// NewScanner returns a new Scanner to read from r.
// The split function defaults to ScanLines.
func NewScanner(r io.Reader) *Scanner {
	return &Scanner{
		r:            r,
		split:        ScanLines,
		maxTokenSize: MaxScanTokenSize,
		buf:          make([]byte, 4096), // Plausible starting size; needn't be large.
	}
}

// Err returns the first non-EOF error that was encountered by the Scanner.
func (s *Scanner) Err() error {
	if s.err == io.EOF {
		return nil
	}
	return s.err
}

// Bytes returns the most recent token generated by a call to Scan.
// The underlying array may point to data that will be overwritten
// by a subsequent call to Scan. It does no allocation.
func (s *Scanner) Bytes() []byte {
	return s.token
}

// Text returns the most recent token generated by a call to Scan
// as a newly allocated string holding its bytes.
func (s *Scanner) Text() string {
	return string(s.token)
}

// Scan advances the Scanner to the next token, which will then be
// available through the Bytes or Text method. It returns false when the
// scan stops, either by reaching the end of the input or an error.
// After Scan returns false, the Err method will return any error that
// occurred during scanning, except that if it was io.EOF, Err
// will return nil.
func (s *Scanner) Scan() bool {
	// Loop until we have a token.
	for {
		// See if we can get a token with what we already have.
		if s.end > s.start {
			advance, token, err := s.split(s.buf[s.start:s.end], s.err != nil)
			if err != nil {
				s.setErr(err)
				return false
			}
			if !s.advance(advance) {
				return false
			}
			s.token = token
			if token != nil {
				return true
			}
		}
		// We cannot generate a token with what we are holding.
		// If we've already hit EOF or an I/O error, we are done.
		if s.err != nil {
			// Shut it down.
			s.start = 0
			s.end = 0
			return false
		}
		// Must read more data.
		// First, shift data to beginning of buffer if there's lots of empty space
		// or space is neded.
		if s.start > 0 && (s.end == len(s.buf) || s.start > len(s.buf)/2) {
			copy(s.buf, s.buf[s.start:s.end])
			s.end -= s.start
			s.start = 0
		}
		// Is the buffer full? If so, resize.
		if s.end == len(s.buf) {
			if len(s.buf) >= s.maxTokenSize {
				s.setErr(ErrTooLong)
				return false
			}
			newSize := len(s.buf) * 2
			if newSize > s.maxTokenSize {
				newSize = s.maxTokenSize
			}
			newBuf := make([]byte, newSize)
			copy(newBuf, s.buf[s.start:s.end])
			s.buf = newBuf
			s.end -= s.start
			s.start = 0
			continue
		}
		// Finally we can read some input. Make sure we don't get stuck with
		// a misbehaving Reader. Officially we don't need to do this, but let's
		// be extra careful: Scanner is for safe, simple jobs.
		for loop := 0; ; {
			n, err := s.r.Read(s.buf[s.end:len(s.buf)])
			s.end += n
			if err != nil {
				s.setErr(err)
				break
			}
			if n > 0 {
				break
			}
			loop++
			if loop > 100 {
				s.setErr(io.ErrNoProgress)
				break
			}
		}
	}
}

// advance consumes n bytes of the buffer. It reports whether the advance was legal.
func (s *Scanner) advance(n int) bool {
	if n < 0 {
		s.setErr(ErrNegativeAdvance)
		return false
	}
	if n > s.end-s.start {
		s.setErr(ErrAdvanceTooFar)
		return false
	}
	s.start += n
	return true
}

// setErr records the first error encountered.
func (s *Scanner) setErr(err error) {
	if s.err == nil || s.err == io.EOF {
		s.err = err
	}
}

// Split sets the split function for the Scanner. If called, it must be
// called before Scan. The default split function is ScanLines.
func (s *Scanner) Split(split SplitFunc) {
	s.split = split
}

// Split functions

// ScanBytes is a split function for a Scanner that returns each byte as a token.
func ScanBytes(data []byte, atEOF bool) (advance int, token []byte, err error) {
	if atEOF && len(data) == 0 {
		return 0, nil, nil
	}
	return 1, data[0:1], nil
}

var errorRune = []byte(string(utf8.RuneError))

// ScanRunes is a split function for a Scanner that returns each
// UTF-8-encoded rune as a token. The sequence of runes returned is
// equivalent to that from a range loop over the input as a string, which
// means that erroneous UTF-8 encodings translate to U+FFFD = "\xef\xbf\xbd".
// Because of the Scan interface, this makes it impossible for the client to
// distinguish correctly encoded replacement runes from encoding errors.
func ScanRunes(data []byte, atEOF bool) (advance int, token []byte, err error) {
	if atEOF && len(data) == 0 {
		return 0, nil, nil
	}

	// Fast path 1: ASCII.
	if data[0] < utf8.RuneSelf {
		return 1, data[0:1], nil
	}

	// Fast path 2: Correct UTF-8 decode without error.
	_, width := utf8.DecodeRune(data)
	if width > 1 {
		// It's a valid encoding. Width cannot be one for a correctly encoded
		// non-ASCII rune.
		return width, data[0:width], nil
	}

	// We know it's an error: we have width==1 and implicitly r==utf8.RuneError.
	// Is the error because there wasn't a full rune to be decoded?
	// FullRune distinguishes correctly between erroneous and incomplete encodings.
	if !atEOF && !utf8.FullRune(data) {
		// Incomplete; get more bytes.
		return 0, nil, nil
	}

	// We have a real UTF-8 encoding error. Return a properly encoded error rune
	// but advance only one byte. This matches the behavior of a range loop over
	// an incorrectly encoded string.
	return 1, errorRune, nil
}

// dropCR drops a terminal \r from the data.
func dropCR(data []byte) []byte {
	if len(data) > 0 && data[len(data)-1] == '\r' {
		return data[0 : len(data)-1]
	}
	return data
}

// ScanLines is a split function for a Scanner that returns each line of
// text, stripped of any trailing end-of-line marker. The returned line may
// be empty. The end-of-line marker is one optional carriage return followed
// by one mandatory newline. In regular expression notation, it is `\r?\n`.
// The last non-empty line of input will be returned even if it has no
// newline.
func ScanLines(data []byte, atEOF bool) (advance int, token []byte, err error) {
	if atEOF && len(data) == 0 {
		return 0, nil, nil
	}
	if i := bytes.IndexByte(data, '\n'); i >= 0 {
		// We have a full newline-terminated line.
		return i + 1, dropCR(data[0:i]), nil
	}
	// If we're at EOF, we have a final, non-terminated line. Return it.
	if atEOF {
		return len(data), dropCR(data), nil
	}
	// Request more data.
	return 0, nil, nil
}

// isSpace reports whether the character is a Unicode white space character.
// We avoid dependency on the unicode package, but check validity of the implementation
// in the tests.
func isSpace(r rune) bool {
	if r <= '\u00FF' {
		// Obvious ASCII ones: \t through \r plus space. Plus two Latin-1 oddballs.
		switch r {
		case ' ', '\t', '\n', '\v', '\f', '\r':
			return true
		case '\u0085', '\u00A0':
			return true
		}
		return false
	}
	// High-valued ones.
	if '\u2000' <= r && r <= '\u200a' {
		return true
	}
	switch r {
	case '\u1680', '\u180e', '\u2028', '\u2029', '\u202f', '\u205f', '\u3000':
		return true
	}
	return false
}

// ScanWords is a split function for a Scanner that returns each
// space-separated word of text, with surrounding spaces deleted. It will
// never return an empty string. The definition of space is set by
// unicode.IsSpace.
func ScanWords(data []byte, atEOF bool) (advance int, token []byte, err error) {
	// Skip leading spaces.
	start := 0
	for width := 0; start < len(data); start += width {
		var r rune
		r, width = utf8.DecodeRune(data[start:])
		if !isSpace(r) {
			break
		}
	}
	if atEOF && len(data) == 0 {
		return 0, nil, nil
	}
	// Scan until space, marking end of word.
	for width, i := 0, start; i < len(data); i += width {
		var r rune
		r, width = utf8.DecodeRune(data[i:])
		if isSpace(r) {
			return i + width, data[start:i], nil
		}
	}
	// If we're at EOF, we have a final, non-empty, non-terminated word. Return it.
	if atEOF && len(data) > start {
		return len(data), data[start:], nil
	}
	// Request more data.
	return 0, nil, nil
}

package main

import (
	"bufio"
	"fmt"
	logger "log"
	"os"
)

const Max = 200005

var log *logger.Logger

func init() {
	log = logger.New(os.Stderr, "", 0)
}

func main() {
	var in = bufio.NewReader(os.Stdin)
	var n int
	if _, err := fmt.Fscanf(in, "%d\n", &n); err != nil {
		log.Printf("Failed to read input: %s", err)
		os.Exit(0)
	}
	var b = make([]int, 0, Max)
	var max = 0
	var min = 1000000001
	for i := 0; i < n; i++ {
		var x int
		if _, err := fmt.Fscanf(in, "%d", &x); err != nil {
			log.Printf("Failed to read input: %s", err)
			os.Exit(0)
		}
		b = append(b, x)
		if max < x {
			max = x
		}
		if min > x {
			min = x
		}
	}

	var md = max - min
	var ans int64 = 0
	var seen = make(map[int]int64)
	for i := 0; i < n; i++ {
		ans += seen[b[i]-md]
		if md > 0 {
			ans += seen[b[i]+md]
		}
		seen[b[i]] += 1
	}

	fmt.Printf("%d %d\n", md, ans)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	var n int
	fmt.Fscanln(reader, &n)
	a := make([]int64, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &a[i])
	}
	fmt.Fscanln(reader)

	sort.Slice(a, func(i, j int) bool {
		return a[i] < a[j]
	})

	min := a[0]
	max := a[n-1]

	if min == max {
		fmt.Println(0, int64(n)*int64(n-1)/2)
		return
	}

	var minCount int64
	var maxCount int64
	for i := 1; i < n; i++ {
		if a[i] != a[i-1] {
			minCount = int64(i)
			break
		}
	}
	for i := n - 2; i >= 0; i-- {
		if a[i] != a[n-1] {
			maxCount = int64(n - 1 - i)
			break
		}
	}
	fmt.Println(max-min, minCount*maxCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

// import bufio, os, strconv
var sc *bufio.Scanner

func scInit() {
	sc = bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
}

func nextInt() int {
	if !sc.Scan() {
		panic("could not scan the reader")
	}
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func nextLong() int64 {
	if !sc.Scan() {
		panic("could not scan the reader")
	}
	i, e := strconv.ParseInt(sc.Text(), 10, 64)
	if e != nil {
		panic(e)
	}
	return i
}

func main() {
	scInit()
	n := nextInt()
	var numMin, numMax int64
	var min, max int64
	numMin, numMax = 0, 0
	min, max = 10000000000, -1
	for i := 0; i < n; i++ {
		b := nextLong()
		if b == min {
			numMin++
		}
		if b < min {
			min = b
			numMin = 1
		}
		if b == max {
			numMax++
		}
		if b > max {
			max = b
			numMax = 1
		}
	}
	var z int64
	if max == min {
		z = numMax * (numMax - 1) / 2
	} else {
		z = numMax * numMin
	}
	fmt.Println(max-min, z)
}

package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

var DEBUG = true

func main() {
	defer Flush()
	n, b := readInts(0)
	_ = n
	var maxc, minc int64
	var maxv, minv int
	minv = b[0]
	maxv = b[0]
	minc = 1
	maxc = 1

	for i := 1; i < n; i++ {
		v := b[i]
		if maxv <= v {
			if maxv < v {
				maxc = 0
			}
			maxv = v
			maxc++
		}
		if v <= minv {
			if v < minv {
				minc = 0
			}
			minv = v
			minc++
		}
	}

	if minv == maxv {
		println(0, maxc*(maxc-1)/2)
		return
	}

	println(maxv-minv, maxc*minc)

}

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Read next line as []byte.  Trailing '\n' will not be included.
// See also comments on readb()
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func dbgf(f string, args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintf(os.Stderr, f, args...)
}

func dbg(args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Utilities

func sumSlice(a []int) int {
	var res int
	for _, v := range a {
		res += v
	}
	return res
}

func sumSlicell(a []int64) int64 {
	var res int64
	for _, v := range a {
		res += v
	}
	return res
}

func readInts(N int) (int, []int) {
	if N == 0 {
		N = readi()
	}
	a := make([]int, N)
	for i := range a {
		a[i] = readi()
	}
	return N, a
}

func readIntsll(N int) (int, []int64) {
	if N == 0 {
		N = readi()
	}
	a := make([]int64, N)
	for i := range a {
		a[i] = readll()
	}
	return N, a
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func minf(a, b float64) float64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func maxf(a, b float64) float64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func absf(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}

// Codeforces 459 B
package main

import (
    "fmt"
    "bufio"
    "strconv"
    "strings"
    "os"
)

var nseg [10]int

func cntseg(v int) int {
    var sum int = 0
    for i:=0; i<11; i++ {
        if v > 0 {
            r := v % 10
            sum += nseg[r]
            v = v / 10
        }
    }
	return sum
}

func main() {
    // reading n
    var n int=0
    in    := bufio.NewReader(os.Stdin)
    s,err := in.ReadString('\n')
    if err != nil {
        fmt.Println("first read failure", err)
    }
    n,err = strconv.Atoi(strings.Trim(s," \n\r"))
    if err != nil {
        fmt.Println("atoi failure", err)
    }
   // fmt.Println("read n =",n)

    // reading b
    s,_ = in.ReadString('\n')
    ss := strings.Split(strings.Trim(s," \n\r")," ")
    ba := make([]int, n)
    for i:=0; i<n; i++ {
        ba[i],err = strconv.Atoi(ss[i])
		if err != nil {
		    fmt.Println("ba atoi failure", err)
		}
    }

    // calculate min max ....
	var nmin,nmax int64
	minb := 2000000000
	maxb := -10000
	for i:=0; i<n; i++ {
	    b := ba[i]
	    if b < minb {
	       minb = b
	       nmin = 1
	    } else if b==minb {
	       nmin++
	    }
	    if b > maxb {
	       maxb = b
	       nmax = 1
	    } else if b==maxb {
	       nmax++
	    }
	}
	var np int64
	var maxdif int
	if maxb==minb {
	    n64 := int64(n)
	    np = n64*(n64-1)/2
	    maxdif = 0
	} else {
		maxdif = maxb - minb
		np = nmin*nmax
	}
	fmt.Printf("%d %d\n",maxdif, np)
}

package main

import (
    "fmt"
    "bufio"
    "os"
    "strconv"
    )

func main() {
    var n, min, max, i, a int64
    var minnum, maxnum, count int64
    fmt.Scan(&n)

    bs := bufio.NewScanner(os.Stdin)
    bs.Split(bufio.ScanWords)
    min = 1e9 + 1
    minnum = 0
    max = 0
    maxnum = 0
    for i = 0; i < n; i++ {
        bs.Scan()
        a, _ = strconv.ParseInt(bs.Text(), 10, 64)
        if a == min {
            minnum++
        } else if a < min {
            min = a
            minnum = 1
        }

        if a == max {
            maxnum++
        } else if a > max {
            max = a
            maxnum = 1
        }
    }

    count = maxnum*minnum
    if min == max {
        count = n * (n-1) / 2
    }
    fmt.Println(max-min, count)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int64
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < int(n); i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	big := array[0]
	small := array[len(array)-1]

	if big == small {
		fmt.Println(0, n*(n-1)/2)
		return
	}

	var bigCount, smallCount int64

	for i := 0; i < len(array); i++ {
		if array[i] == big {
			bigCount++
		}
		if array[i] == small {
			smallCount++
		}
		//fmt.Println("testzhaoyi ", array[i], array[len(array)-i], bigCount, smallCount)
	}

	fmt.Println(less, bigCount*smallCount)
}

package main

import (
	"fmt"
	"sort"
	"bufio"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
func readInt() int {
	scanner.Scan()
	ans, _ := strconv.Atoi(scanner.Text())
	return ans
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := readInt()
	var x int
	tmap := make(map[int]int)
	for i := 0; i < n; i++ {
		x = readInt()
		tmap[x] = tmap[x] + 1
	}

	type mapii struct {
		k int
		v int
	}
	var bmap []mapii

	for k, v := range tmap {
		bmap = append(bmap, mapii{k, v})
	}

	sort.Slice(bmap, func(i, j int) bool {
		return bmap[i].k < bmap[j].k
	})

	if len(bmap) != 1 {
		fmt.Println(bmap[len(bmap)-1].k - bmap[0].k, int64(bmap[len(bmap)-1].v) * int64(bmap[0].v))
	} else {
		fmt.Println(0, (int64(bmap[0].v) * int64(bmap[0].v-1))/2)
	}
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
var writer = bufio.NewWriter(os.Stdout)

//Wrong
func main() {
	defer writer.Flush()
	scanner.Split(bufio.ScanWords)

	n := nextInt()
	b := make([]int, n)
	min, max := 1<<31 -1, 0

	for i := 0; i < n; i++ {
		b[i] = nextInt()

		if b[i] < min {
			min = b[i]
		}

		if b[i] > max {
			max = b[i]
		}
	}

	countMin, countMax := 0, 0

	for i := 0; i < n; i++ {
		if b[i] == min {
			countMin++
		}

		if b[i] == max {
			countMax++
		}
	}

	if countMax == n {
		println(0, int64(n) * (int64(n) - 1) / 2)
	} else {
		println(max - min, int64(int64(countMax) * int64(countMin)))
	}
}

func next() string {
	if !scanner.Scan() {
		panic("Scan error")
	}
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(next())
	if err != nil {
		panic(err)
	}
	return n
}

func nextFloat() float64 {
	n, err := strconv.ParseFloat(next(), 64)
	if err != nil {
		panic(err)
	}
	return n
}

func println(a ...interface{}) {
	fmt.Fprintln(writer, a...)
}

func print(a ...interface{}) {
	fmt.Fprint(writer, a...)
}

func printf(format string, a ...interface{}) {
	fmt.Fprintf(writer, format, a...)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	var n int
	fmt.Scanf("%d \n", &n)

	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')
	list := strings.Split(strings.TrimRight(line, "\r\n"), " ")

	min := 1000000001
	max := 0
	cmin := 0
	cmax := 0
	for i := 0; i < n; i++ {
		temp, _ := strconv.Atoi(list[i])
		t := int(temp)
		if t < min {
			min = t
			cmin = 0
		}
		if t > max {
			max = t
			cmax = 0
		}
		if t == min {
			cmin++
		}
		if t == max {
			cmax++
		}
	}

	fmt.Println(max-min, cmax*cmin)
	if n == 200000 {
		fmt.Println(cmax, cmin, cmax*cmin, int64(cmax)*int64(cmin))
	}
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	var n int
	fmt.Scanf("%d \n", &n)

	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')
	list := strings.Split(strings.TrimRight(line, "\r\n"), " ")

	min := 1000000001
	max := 0
	cmin := 0
	cmax := 0
	for i := 0; i < n; i++ {
		temp, _ := strconv.Atoi(list[i])
		t := int(temp)
		if t < min {
			min = t
			cmin = 0
		}
		if t > max {
			max = t
			cmax = 0
		}
		if t == min {
			cmin++
		}
		if t == max {
			cmax++
		}
	}

	fmt.Println(max-min, int64(cmax)*int64(cmin))
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	var n int
	fmt.Scanf("%d \n", &n)

	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')
	list := strings.Split(strings.TrimRight(line, "\r\n"), " ")

	min := 1000000001
	max := 0
	cmin := 0
	cmax := 0
	for i := 0; i < n; i++ {
		temp, _ := strconv.Atoi(list[i])
		t := int(temp)
		if t < min {
			min = t
			cmin = 0
		}
		if t > max {
			max = t
			cmax = 0
		}
		if t == min {
			cmin++
		}
		if t == max {
			cmax++
		}
	}

	fmt.Println(max-min, cmax*cmin)
	if n == 200000 {
		fmt.Println(cmax, cmin)
	}
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	var n int
	fmt.Scanf("%d \n", &n)

	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')
	list := strings.Split(strings.TrimRight(line, "\r\n"), " ")

	min := 1000000001
	cmin := 0
	max := 0
	cmax := 0
	for i := 0; i < n; i++ {
		temp, _ := strconv.Atoi(list[i])
		t := int(temp)
		if t < min {
			min = t
			cmin = 0
		}
		if t > max {
			max = t
			cmax = 0
		}
		if t == min {
			cmin++
		}
		if t == max {
			cmax++
		}
	}

	fmt.Print(max-min, cmax*cmin)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max, min := numbers[0], numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		pairCount = n * (n - 1) / 2
	}

	fmt.Printf("%d %d", maxGap, pairCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max, min := numbers[0], numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		panic("Runtime error")
		pairCount = n * (n - 1) / 2
	}

	fmt.Printf("%d %d", maxGap, pairCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max, min := numbers[0], numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		pairCount = n * (n - 1) / 2
	}

	fmt.Println(maxGap, pairCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max := numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
	}

	min := numbers[0]
	for i := 0; i < n; i++ {
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	// for i := 0; i < n-1; i++ {
	// 	for j := i + 1; j < n; j++ {
	// 		n1, n2 := numbers[i], numbers[j]
	// 		var gap int
	// 		if n1 > n2 {
	// 			gap = n1 - n2
	// 		} else {
	// 			gap = n2 - n1
	// 		}
	// 		if gap == maxGap {
	// 			pairCounter++
	// 		} else if gap > maxGap {
	// 			maxGap = gap
	// 			pairCounter = 1
	// 		}
	// 	}
	// }

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		pairCount = 1
		for i := numberCount[max]; i > 0; i-- {
			pairCount *= i
		}
	}

	fmt.Printf("%d %d", maxGap, pairCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max, min := numbers[0], numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	if n == 200000 {
		fmt.Println(numberCount[max], numberCount[min])
	}

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		pairCount = n * (n - 1) / 2
	}

	fmt.Println(maxGap, pairCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max, min := numbers[0], numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	// for i := 0; i < n-1; i++ {
	// 	for j := i + 1; j < n; j++ {
	// 		n1, n2 := numbers[i], numbers[j]
	// 		var gap int
	// 		if n1 > n2 {
	// 			gap = n1 - n2
	// 		} else {
	// 			gap = n2 - n1
	// 		}
	// 		if gap == maxGap {
	// 			pairCounter++
	// 		} else if gap > maxGap {
	// 			maxGap = gap
	// 			pairCounter = 1
	// 		}
	// 	}
	// }

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		pairCount = numberCount[max] * (numberCount[max] - 1) / 2
	}

	fmt.Printf("%d %d", maxGap, pairCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max, min := numbers[0], numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	if n == 200000 {
		fmt.Println(numberCount)
	}

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		pairCount = n * (n - 1) / 2
	}

	fmt.Println(maxGap, pairCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	line, _ := reader.ReadString('\n')

	var n int
	fmt.Sscanf(line, "%d", &n)
	numbers := make([]int, n)

	line, _ = reader.ReadString('\n')

	tokens := strings.Fields(line)

	for i := 0; i < n; i++ {
		numbers[i], _ = strconv.Atoi(tokens[i])
	}

	numberCount := make(map[int]int)

	max := numbers[0]
	for i := 0; i < n; i++ {
		numberCount[numbers[i]] = numberCount[numbers[i]] + 1
		if numbers[i] > max {
			max = numbers[i]
		}
	}

	min := numbers[0]
	for i := 0; i < n; i++ {
		if numbers[i] < min {
			min = numbers[i]
		}
	}

	// for i := 0; i < n-1; i++ {
	// 	for j := i + 1; j < n; j++ {
	// 		n1, n2 := numbers[i], numbers[j]
	// 		var gap int
	// 		if n1 > n2 {
	// 			gap = n1 - n2
	// 		} else {
	// 			gap = n2 - n1
	// 		}
	// 		if gap == maxGap {
	// 			pairCounter++
	// 		} else if gap > maxGap {
	// 			maxGap = gap
	// 			pairCounter = 1
	// 		}
	// 	}
	// }

	maxGap := max - min
	var pairCount int
	if maxGap != 0 {
		pairCount = numberCount[max] * numberCount[min]
	} else {
		pairCount = 1
		for i := numberCount[max] - 1; i > 0; i-- {
			pairCount *= i
		}
	}

	fmt.Printf("%d %d", maxGap, pairCount)

}

package main

import (
	"fmt"
	logger "log"
	"os"
)

var log *logger.Logger

func init() {
	log = logger.New(os.Stderr, "", 0)
}

func main() {
	var n int
	if _, err := fmt.Scanf("%d", &n); err != nil {
		log.Printf("Failed to read input: %s", err)
		os.Exit(0)
	}
	var b = make([]int, 0)
	var max = 0
	var min = 1000000001
	for i := 0; i < n; i++ {
		var x int
		if _, err := fmt.Scanf("%d", &x); err != nil {
			log.Printf("Failed to read input: %s", err)
			os.Exit(0)
		}
		b = append(b, x)
		if max < x {
			max = x
		}
		if min > x {
			min = x
		}
	}

	var md = max - min
	var ans int64 = 0
	var seen = make(map[int]int64)
	for i := 0; i < n; i++ {
		ans += seen[b[i]-md]
		ans += seen[b[i]+md]
		seen[b[i]] += 1
	}

	fmt.Printf("%d %d\n", md, ans)
}

package main

import (
	"bufio"
	"fmt"
	logger "log"
	"os"
)

const Max = 200005

var log *logger.Logger

func init() {
	log = logger.New(os.Stderr, "", 0)
}

func main() {
	var in = bufio.NewReader(os.Stdin)
	var n int
	if _, err := fmt.Fscanf(in, "%d\n", &n); err != nil {
		log.Printf("Failed to read input: %s", err)
		os.Exit(0)
	}
	var b = make([]int, 0, Max)
	var max = 0
	var min = 1000000001
	for i := 0; i < n; i++ {
		var x int
		if _, err := fmt.Fscanf(in, "%d", &x); err != nil {
			log.Printf("Failed to read input: %s", err)
			os.Exit(0)
		}
		b = append(b, x)
		if max < x {
			max = x
		}
		if min > x {
			min = x
		}
	}

	var md = max - min
	var ans int64 = 0
	var seen = make(map[int]int64)
	for i := 0; i < n; i++ {
		ans += seen[b[i]-md]
		ans += seen[b[i]+md]
		seen[b[i]] += 1
	}

	fmt.Printf("%d %d\n", md, ans)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	var n int
	fmt.Fscanln(reader, &n)
	a := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &a[i])
	}
	fmt.Fscanln(reader)

	sort.Slice(a, func(i, j int) bool {
		return a[i] < a[j]
	})

	min := a[0]
	max := a[n-1]

	if min == max {
		fmt.Println(0, n*(n-1)/2)
		return
	}

	minCount := 1
	maxCount := 1
	for i := 1; i < n; i++ {
		if a[i] != a[i-1] {
			minCount = i
			break
		}
	}
	for i := n - 2; i >= 0; i-- {
		if a[i] != a[n-1] {
			maxCount = n - 1 - i
			break
		}
	}
	fmt.Println(max-min, minCount*maxCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	reader := bufio.NewReader(os.Stdin)
	var n int
	fmt.Fscanln(reader, &n)
	a := make([]int64, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &a[i])
	}
	fmt.Fscanln(reader)

	sort.Slice(a, func(i, j int) bool {
		return a[i] < a[j]
	})

	min := a[0]
	max := a[n-1]

	if min == max {
		fmt.Println(0, n*(n-1)/2)
		return
	}

	var minCount int64
	var maxCount int64
	for i := 1; i < n; i++ {
		if a[i] != a[i-1] {
			minCount = int64(i)
			break
		}
	}
	for i := n - 2; i >= 0; i-- {
		if a[i] != a[n-1] {
			maxCount = int64(n - 1 - i)
			break
		}
	}
	fmt.Println(max-min, minCount*maxCount)

}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

// import bufio, os, strconv
var sc *bufio.Scanner

func scInit() {
	sc = bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
}

func nextInt() int {
	if !sc.Scan() {
		panic("could not scan the reader")
	}
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func nextLong() int64 {
	if !sc.Scan() {
		panic("could not scan the reader")
	}
	i, e := strconv.ParseInt(sc.Text(), 10, 64)
	if e != nil {
		panic(e)
	}
	return i
}

func main() {
	scInit()
	n := nextInt()
	var numMin, numMax int64
	var min, max int64
	numMin, numMax = 0, 0
	min, max = 10000000000, -1
	for i := 0; i < n; i++ {
		b := nextLong()
		if b == min {
			numMin++
		}
		if b < min {
			min = b
			numMin = 1
		}
		if b == max {
			numMax++
		}
		if b > max {
			max = b
			numMax = 1
		}
	}
	fmt.Println(max-min, numMin*numMax)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

// import bufio, os, strconv
var sc *bufio.Scanner

func scInit() {
	sc = bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
}

func nextInt() int {
	if !sc.Scan() {
		panic("could not scan the reader")
	}
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func nextLong() int64 {
	if !sc.Scan() {
		panic("could not scan the reader")
	}
	i, e := strconv.ParseInt(sc.Text(), 10, 64)
	if e != nil {
		panic(e)
	}
	return i
}

func main() {
	scInit()
	n := nextInt()
	var numMin, numMax int
	var min, max int64
	numMin, numMax = 0, 0
	min, max = 10000000000, -1
	for i := 0; i < n; i++ {
		b := nextLong()
		if b == min {
			numMin++
		}
		if b < min {
			min = b
			numMin = 1
		}
		if b == max {
			numMax++
		}
		if b > max {
			max = b
			numMax = 1
		}
	}
	fmt.Println(max-min, numMin*numMax)
}

package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

var DEBUG = true

func main() {
	defer Flush()
	n, b := readInts(0)
	_ = n
	var minv, minc, maxv, maxc int
	minv = b[0]
	maxv = b[0]
	minc = 1
	maxc = 1

	for i := 1; i < n; i++ {
		v := b[i]
		if maxv <= v {
			if maxv < v {
				maxc = 0
			}
			maxv = v
			maxc++
		}
		if v <= minv {
			if v < minv {
				minc = 0
			}
			minv = v
			minc++
		}
	}

	if minv == maxv {
		println(0, maxc*(maxc-1)/2)
	}

	println(maxv-minv, maxc*minc)

}

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Read next line as []byte.  Trailing '\n' will not be included.
// See also comments on readb()
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func dbgf(f string, args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintf(os.Stderr, f, args...)
}

func dbg(args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Utilities

func sumSlice(a []int) int {
	var res int
	for _, v := range a {
		res += v
	}
	return res
}

func sumSlicell(a []int64) int64 {
	var res int64
	for _, v := range a {
		res += v
	}
	return res
}

func readInts(N int) (int, []int) {
	if N == 0 {
		N = readi()
	}
	a := make([]int, N)
	for i := range a {
		a[i] = readi()
	}
	return N, a
}

func readIntsll(N int) (int, []int64) {
	if N == 0 {
		N = readi()
	}
	a := make([]int64, N)
	for i := range a {
		a[i] = readll()
	}
	return N, a
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func minf(a, b float64) float64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func maxf(a, b float64) float64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func absf(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}

package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

var DEBUG = true

func main() {
	defer Flush()
	n, b := readInts(0)
	_ = n
	var minv, minc, maxv, maxc int
	minv = b[0]
	maxv = b[0]

	for _, v := range b {
		if maxv <= v {
			if maxv < v {
				maxc = 0
			}
			maxv = v
			maxc++
		}
		if v <= minv {
			if v < minv {
				minc = 0
			}
			minv = v
			minc++
		}
	}

	println(maxv-minv, maxc*minc)

}

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Read next line as []byte.  Trailing '\n' will not be included.
// See also comments on readb()
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func dbgf(f string, args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintf(os.Stderr, f, args...)
}

func dbg(args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Utilities

func sumSlice(a []int) int {
	var res int
	for _, v := range a {
		res += v
	}
	return res
}

func sumSlicell(a []int64) int64 {
	var res int64
	for _, v := range a {
		res += v
	}
	return res
}

func readInts(N int) (int, []int) {
	if N == 0 {
		N = readi()
	}
	a := make([]int, N)
	for i := range a {
		a[i] = readi()
	}
	return N, a
}

func readIntsll(N int) (int, []int64) {
	if N == 0 {
		N = readi()
	}
	a := make([]int64, N)
	for i := range a {
		a[i] = readll()
	}
	return N, a
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func minf(a, b float64) float64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func maxf(a, b float64) float64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func absf(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}

package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

var DEBUG = true

func main() {
	defer Flush()
	n, b := readInts(0)
	_ = n
	var minv, minc, maxv, maxc int
	minv = b[0]
	maxv = b[0]

	for _, v := range b {
		if maxv <= v {
			if maxv < v {
				maxc = 0
			}
			maxv = v
			maxc++
		}
		if v <= minv {
			if v < minv {
				minc = 0
			}
			minv = v
			minc++
		}
	}

	if minv == maxv {
		println(0, maxc*(maxc-1)/2)
	}

	println(maxv-minv, maxc*minc)

}

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Read next line as []byte.  Trailing '\n' will not be included.
// See also comments on readb()
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func dbgf(f string, args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintf(os.Stderr, f, args...)
}

func dbg(args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Utilities

func sumSlice(a []int) int {
	var res int
	for _, v := range a {
		res += v
	}
	return res
}

func sumSlicell(a []int64) int64 {
	var res int64
	for _, v := range a {
		res += v
	}
	return res
}

func readInts(N int) (int, []int) {
	if N == 0 {
		N = readi()
	}
	a := make([]int, N)
	for i := range a {
		a[i] = readi()
	}
	return N, a
}

func readIntsll(N int) (int, []int64) {
	if N == 0 {
		N = readi()
	}
	a := make([]int64, N)
	for i := range a {
		a[i] = readll()
	}
	return N, a
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func minf(a, b float64) float64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func maxf(a, b float64) float64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func absf(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}

package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

var DEBUG = true

func main() {
	defer Flush()
	n, b := readInts(0)
	_ = n
	var maxc, minc int64
	var maxv, minv int
	minv = b[0]
	maxv = b[0]
	minc = 1
	maxc = 1

	for i := 1; i < n; i++ {
		v := b[i]
		if maxv <= v {
			if maxv < v {
				maxc = 0
			}
			maxv = v
			maxc++
		}
		if v <= minv {
			if v < minv {
				minc = 0
			}
			minv = v
			minc++
		}
	}

	if minv == maxv {
		println(0, maxc*(maxc-1)/2)
	}

	println(maxv-minv, maxc*minc)

}

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Read next line as []byte.  Trailing '\n' will not be included.
// See also comments on readb()
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func dbgf(f string, args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintf(os.Stderr, f, args...)
}

func dbg(args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Utilities

func sumSlice(a []int) int {
	var res int
	for _, v := range a {
		res += v
	}
	return res
}

func sumSlicell(a []int64) int64 {
	var res int64
	for _, v := range a {
		res += v
	}
	return res
}

func readInts(N int) (int, []int) {
	if N == 0 {
		N = readi()
	}
	a := make([]int, N)
	for i := range a {
		a[i] = readi()
	}
	return N, a
}

func readIntsll(N int) (int, []int64) {
	if N == 0 {
		N = readi()
	}
	a := make([]int64, N)
	for i := range a {
		a[i] = readll()
	}
	return N, a
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func minf(a, b float64) float64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func maxf(a, b float64) float64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func absf(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}

// Codeforces 459 B
package main

import (
    "fmt"
    "bufio"
    "strconv"
    "strings"
    "os"
)

var nseg [10]int

func cntseg(v int) int {
    var sum int = 0
    for i:=0; i<11; i++ {
        if v > 0 {
            r := v % 10
            sum += nseg[r]
            v = v / 10
        }
    }
	return sum
}

func main() {
    // reading n
    var n int=0
    in    := bufio.NewReader(os.Stdin)
    s,_ := in.ReadString('\n')
    n,_ = strconv.Atoi(strings.Trim(s," \n"))
    // fmt.Println("read n =",n)

    // reading b
    s,_ = in.ReadString('\n')
    ss := strings.Split(strings.Trim(s," \n")," ")
    ba := make([]int, n)
    for i:=0; i<n; i++ {
        ba[i],_ = strconv.Atoi(ss[i])
    }

    // calculate min max ....
	maxdif := 0
	nmin,nmax := 0,0
	minb := 2000000000
	maxb := -1;
	for i:=0; i<n; i++ {
	    b := ba[i]
	    if b < minb {
	       minb = b
	       nmin = 1
	    } else if b==minb {
	       nmin++
	    }
	    if b > maxb {
	       maxb = b
	       nmax = 1
	    } else if b==maxb {
	       nmax++
	    }
	}
	maxdif = maxb - minb
	fmt.Printf("%d %d\n",maxdif, nmin*nmax)
}

// Codeforces 459 B
package main

import (
    "fmt"
    "bufio"
    "strconv"
    "strings"
    "os"
)

var nseg [10]int

func cntseg(v int) int {
    var sum int = 0
    for i:=0; i<11; i++ {
        if v > 0 {
            r := v % 10
            sum += nseg[r]
            v = v / 10
        }
    }
	return sum
}

func main() {
    // reading n
    var n int=0
    in    := bufio.NewReader(os.Stdin)
    s,err := in.ReadString('\n')
    if err != nil {
        fmt.Println("first read failure", err)
    }
    n,err = strconv.Atoi(strings.Trim(s," \n\r"))
    if err != nil {
        fmt.Println("atoi failure", err)
    }
   // fmt.Println("read n =",n)

    // reading b
    s,_ = in.ReadString('\n')
    ss := strings.Split(strings.Trim(s," \n\r")," ")
    ba := make([]int, n)
    for i:=0; i<n; i++ {
        ba[i],err = strconv.Atoi(ss[i])
		if err != nil {
		    fmt.Println("ba atoi failure", err)
		}
    }

    // calculate min max ....
	maxdif := 0
	nmin,nmax := 0,0
	minb := 2000000000
	maxb := -1;
	for i:=0; i<n; i++ {
	    b := ba[i]
	    if b < minb {
	       minb = b
	       nmin = 1
	    } else if b==minb {
	       nmin++
	    }
	    if b > maxb {
	       maxb = b
	       nmax = 1
	    } else if b==maxb {
	       nmax++
	    }
	}
	maxdif = maxb - minb
	fmt.Printf("%d %d\n",maxdif, nmin*nmax)
}

// Codeforces 459 B
package main

import (
    "fmt"
    "bufio"
    "strconv"
    "strings"
    "os"
)

var nseg [10]int

func cntseg(v int) int {
    var sum int = 0
    for i:=0; i<11; i++ {
        if v > 0 {
            r := v % 10
            sum += nseg[r]
            v = v / 10
        }
    }
	return sum
}

func main() {
    // reading n
    var n int=0
    in    := bufio.NewReader(os.Stdin)
    s,err := in.ReadString('\n')
    if err != nil {
        fmt.Println("first read failure", err)
    }
    n,err = strconv.Atoi(strings.Trim(s," \n\r"))
    if err != nil {
        fmt.Println("atoi failure", err)
    }
   // fmt.Println("read n =",n)

    // reading b
    s,_ = in.ReadString('\n')
    ss := strings.Split(strings.Trim(s," \n\r")," ")
    ba := make([]int, n)
    for i:=0; i<n; i++ {
        ba[i],err = strconv.Atoi(ss[i])
		if err != nil {
		    fmt.Println("ba atoi failure", err)
		}
    }

    // calculate min max ....
	var nmin,nmax int64
	minb := 2000000000
	maxb := -10000
	for i:=0; i<n; i++ {
	    b := ba[i]
	    if b < minb {
	       minb = b
	       nmin = 1
	    } else if b==minb {
	       nmin++
	    }
	    if b > maxb {
	       maxb = b
	       nmax = 1
	    } else if b==maxb {
	       nmax++
	    }
	}
	maxdif := maxb - minb
	fmt.Printf("%d %d\n",maxdif, nmin*nmax)
}

// Codeforces 459 B
package main

import (
    "fmt"
    "bufio"
    "strconv"
    "strings"
    "os"
)

var nseg [10]int

func cntseg(v int) int {
    var sum int = 0
    for i:=0; i<11; i++ {
        if v > 0 {
            r := v % 10
            sum += nseg[r]
            v = v / 10
        }
    }
	return sum
}

func main() {
    // reading n
    var n int=0
    in    := bufio.NewReader(os.Stdin)
    s,err := in.ReadString('\n')
    if err != nil {
        fmt.Println("first read failure", err)
    }
    n,err = strconv.Atoi(strings.Trim(s," \n"))
    if err != nil {
        fmt.Println("atoi failure", err)
    }
   // fmt.Println("read n =",n)

    // reading b
    s,_ = in.ReadString('\n')
    ss := strings.Split(strings.Trim(s," \n")," ")
    ba := make([]int, n)
    for i:=0; i<n; i++ {
        ba[i],err = strconv.Atoi(ss[i])
		if err != nil {
		    fmt.Println("ba atoi failure", err)
		}
    }

    // calculate min max ....
	maxdif := 0
	nmin,nmax := 0,0
	minb := 2000000000
	maxb := -1;
	for i:=0; i<n; i++ {
	    b := ba[i]
	    if b < minb {
	       minb = b
	       nmin = 1
	    } else if b==minb {
	       nmin++
	    }
	    if b > maxb {
	       maxb = b
	       nmax = 1
	    } else if b==maxb {
	       nmax++
	    }
	}
	maxdif = maxb - minb
	fmt.Printf("%d %d\n",maxdif, nmin*nmax)
}

package main

import (
    "fmt"
    "bufio"
    "os"
    "strconv"
    )

func main() {
    var n, min, minnum, max, maxnum int
    fmt.Scan(&n)

    bs := bufio.NewScanner(os.Stdin)
    bs.Split(bufio.ScanWords)
    min = 1e9
    minnum = 0
    max = 0
    maxnum = 0
    for i := 0; i < n; i++ {
        bs.Scan()
        a, _ := strconv.Atoi(bs.Text())
        if a == min {
            minnum++
        } else if a < min {
            min = a
            minnum = 1
        }

        if a == max {
            maxnum++
        } else if a > max {
            max = a
            maxnum = 1
        }
    }

    fmt.Println(max-min, maxnum*minnum)
}

package main

import (
    "fmt"
    "bufio"
    "os"
    "strconv"
    )

func main() {
    var n, min, max int
    var minnum, maxnum uint64
    fmt.Scan(&n)

    bs := bufio.NewScanner(os.Stdin)
    bs.Split(bufio.ScanWords)
    min = 1e9
    minnum = 0
    max = 0
    maxnum = 0
    for i := 0; i < n; i++ {
        bs.Scan()
        a, _ := strconv.Atoi(bs.Text())
        if a == min {
            minnum++
        } else if a < min {
            min = a
            minnum = 1
        }

        if a == max {
            maxnum++
        } else if a > max {
            max = a
            maxnum = 1
        }
    }

    if min == max {
        minnum = minnum / 2
        maxnum = maxnum - minnum
    }

    fmt.Println(max-min, maxnum*minnum)
}

package main

import (
    "fmt"
    "bufio"
    "os"
    "strconv"
    )

func main() {
    var n, min, max int
    var minnum, maxnum uint64
    fmt.Scan(&n)

    bs := bufio.NewScanner(os.Stdin)
    bs.Split(bufio.ScanWords)
    min = 1e9
    minnum = 0
    max = 0
    maxnum = 0
    for i := 0; i < n; i++ {
        bs.Scan()
        a, _ := strconv.Atoi(bs.Text())
        if a == min {
            minnum++
        } else if a < min {
            min = a
            minnum = 1
        }

        if a == max {
            maxnum++
        } else if a > max {
            max = a
            maxnum = 1
        }
    }

    fmt.Println(max-min, maxnum*minnum)
}

package main

import (
    "fmt"
    "bufio"
    "os"
    "strconv"
    )

func main() {
    var n, i int
    var sum, a, minodd int64
    fmt.Scan(&n)

    bs := bufio.NewScanner(os.Stdin)
    bs.Split(bufio.ScanWords)
    minodd = 1e9
    for i = 0; i < n; i++ {
        bs.Scan()
        a, _ = strconv.ParseInt(bs.Text(), 10, 64)
        if a % 2 == 0 {
            sum += a
        } else {
            if minodd > a {
                if minodd != 1e9 {
                    sum += minodd
                }
                minodd = a
            } else {
                sum += a
            }
        }
    }

    if sum % 2 != 0 {
        sum += minodd
    }

    fmt.Println(sum)
}

package main

import (
    "fmt"
    "bufio"
    "os"
    "strconv"
    )

func main() {
    var n, min, max int
    var minnum, maxnum uint64
    fmt.Scan(&n)

    bs := bufio.NewScanner(os.Stdin)
    bs.Split(bufio.ScanWords)
    min = 1e9 + 1
    minnum = 0
    max = 0
    maxnum = 0
    for i := 0; i < n; i++ {
        bs.Scan()
        a, _ := strconv.Atoi(bs.Text())
        if a == min {
            minnum++
        } else if a < min {
            min = a
            minnum = 1
        }

        if a == max {
            maxnum++
        } else if a > max {
            max = a
            maxnum = 1
        }
    }

    if min == max {
        minnum = minnum / 2
        maxnum = maxnum - minnum
    }

    fmt.Println(max-min, maxnum*minnum)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	big := array[0]
	small := array[len(array)-1]

	if big == small {
		fmt.Println(0, n*(n-1)/2)
	}

	var bigCount, smallCount int64

	for i := 0; i < len(array); i++ {
		if array[i] == big {
			bigCount++
		}
		if array[i] == small {
			smallCount++
		}
		//fmt.Println("testzhaoyi ", array[i], array[len(array)-i], bigCount, smallCount)
	}

	fmt.Println(less, bigCount*smallCount)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	big := array[0]
	small := array[len(array)-1]

	if big == small {
		fmt.Println(0, n*(n-1)/2)
		return
	}

	var bigCount, smallCount int64

	for i := 0; i < len(array); i++ {
		if array[i] == big {
			bigCount++
		}
		if array[i] == small {
			smallCount++
		}
		//fmt.Println("testzhaoyi ", array[i], array[len(array)-i], bigCount, smallCount)
	}

	fmt.Println(less, bigCount*smallCount)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	big := array[0]
	small := array[len(array)-1]
	bigCount := 1
	smallCount := 1
	for i := 1; i <= len(array)/2; i++ {
		if array[i] == big {
			bigCount++
		}
		if array[len(array)-i-1] == small {
			smallCount++
		}
		//fmt.Println("testzhaoyi ", array[i], array[len(array)-i], bigCount, smallCount)
	}

	fmt.Println(less, bigCount*smallCount)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	count := 1
	for i := 1; i <= len(array)/2; i++ {
		if array[i]-array[len(array)-i] == less {
			count++
		}
	}
	fmt.Println(less, count*count)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	big := array[0]
	small := array[len(array)-1]
	bigCount := 1
	smallCount := 1
	for i := 1; i <= len(array)/2; i++ {
		if array[i] == big {
			bigCount++
		}
		if array[len(array)-i] == small {
			smallCount++
		}
		//fmt.Println("testzhaoyi ", array[i], array[len(array)-i], bigCount, smallCount)
	}

	if bigCount < smallCount {
		smallCount = bigCount
	}

	if smallCount < bigCount {
		bigCount = smallCount
	}

	fmt.Println(less, bigCount*smallCount)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	big := array[0]
	small := array[len(array)-1]

	if big == small {
		fmt.Println(0, len(array))
	}

	bigCount := 0
	smallCount := 0

	for i := 0; i < len(array); i++ {
		if array[i] == big {
			bigCount++
		}
		if array[i] == small {
			smallCount++
		}
		//fmt.Println("testzhaoyi ", array[i], array[len(array)-i], bigCount, smallCount)
	}

	fmt.Println(less, bigCount*smallCount)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] >= array[j]
	})

	less := array[0] - array[len(array)-1]
	count := 1
	for i := 1; i <= len(array)/2; i++ {
		if array[i]-array[len(array)-i] == less {
			count++
		}
	}
	fmt.Println(less, count*count)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

func main() {
	var n int
	reader := bufio.NewReader(os.Stdin)
	fmt.Fscanln(reader, &n)

	if n == 1 {
		fmt.Println(0, 0)
	}

	array := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(reader, &array[i])
	}

	sort.Slice(array, func(i, j int) bool {
		return array[i] > array[j]
	})

	less := array[0] - array[len(array)-1]
	big := array[0]
	small := array[len(array)-1]
	bigCount := 1
	smallCount := 0
	for i := 1; i < len(array); i++ {
		if array[i] == big {
			bigCount++
		}
		if array[i] == small {
			smallCount++
		}
		//fmt.Println("testzhaoyi ", array[i], array[len(array)-i], bigCount, smallCount)
	}

	fmt.Println(less, bigCount*smallCount)
}

package main

import (
	"fmt"
	"sort"
	"bufio"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
func readInt() int {
	scanner.Scan()
	ans, _ := strconv.Atoi(scanner.Text())
	return ans
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := readInt()
	var x int
	tmap := make(map[int]int)
	for i := 0; i < n; i++ {
		x = readInt()
		tmap[x] = tmap[x] + 1
	}

	type mapii struct {
		k int
		v int
	}
	var bmap []mapii

	for k, v := range tmap {
		bmap = append(bmap, mapii{k, v})
	}

	sort.Slice(bmap, func(i, j int) bool {
		return bmap[i].k < bmap[j].k
	})

	if len(bmap) != 0 {
		fmt.Println(bmap[len(bmap)-1].k - bmap[0].k, int64(bmap[len(bmap)-1].v) * int64(bmap[0].v))
	} else {
		fmt.Println(0, 1)
	}
}

package main

import (
	"fmt"
	"sort"
	"bufio"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
func readInt() int {
	scanner.Scan()
	ans, _ := strconv.Atoi(scanner.Text())
	return ans
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := readInt()
	var x int
	tmap := make(map[int]int)
	for i := 0; i < n; i++ {
		x = readInt()
		tmap[x] = tmap[x] + 1
	}

	type mapii struct {
		k int
		v int
	}
	var bmap []mapii

	for k, v := range tmap {
		bmap = append(bmap, mapii{k, v})
	}

	sort.Slice(bmap, func(i, j int) bool {
		return bmap[i].k < bmap[j].k
	})

	if len(bmap) != 0 {
		fmt.Println(bmap[len(bmap)-1].k - bmap[0].k, int64(bmap[len(bmap)-1].v) * int64(bmap[0].v))
	} else {
		fmt.Println(0, 0)
	}
}

package main

import (
	"fmt"
	"sort"
	"bufio"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
func readInt() int {
	scanner.Scan()
	ans, _ := strconv.Atoi(scanner.Text())
	return ans
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := readInt()
	var x int
	tmap := make(map[int]int)
	for i := 0; i < n; i++ {
		x = readInt()
		tmap[x] = tmap[x] + 1
	}

	type mapii struct {
		k int
		v int
	}
	var bmap []mapii

	for k, v := range tmap {
		bmap = append(bmap, mapii{k, v})
	}

	sort.Slice(bmap, func(i, j int) bool {
		return bmap[i].k < bmap[j].k
	})

	fmt.Println(bmap[len(bmap)-1].k - bmap[0].k, bmap[len(bmap)-1].v * bmap[0].v)
}

package main

import (
	"fmt"
	"sort"
	"bufio"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
func readInt() int {
	scanner.Scan()
	ans, _ := strconv.Atoi(scanner.Text())
	return ans
}

func main() {
	scanner.Split(bufio.ScanWords)

	n := readInt()
	var x int
	tmap := make(map[int]int)
	for i := 0; i < n; i++ {
		x = readInt()
		tmap[x] = tmap[x] + 1
	}

	type mapii struct {
		k int
		v int
	}
	var bmap []mapii

	for k, v := range tmap {
		bmap = append(bmap, mapii{k, v})
	}

	sort.Slice(bmap, func(i, j int) bool {
		return bmap[i].k < bmap[j].k
	})

	fmt.Println(bmap[len(bmap)-1].k - bmap[0].k, int64(bmap[len(bmap)-1].v) * int64(bmap[0].v))
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
var writer = bufio.NewWriter(os.Stdout)

//Wrong
func main() {
	defer writer.Flush()
	scanner.Split(bufio.ScanWords)

	n := nextInt()
	b := make([]int, n)
	min, max := 1<<31 -1, 0

	for i := 0; i < n; i++ {
		b[i] = nextInt()

		if b[i] < min {
			min = b[i]
		}

		if b[i] > max {
			max = b[i]
		}
	}

	countMin, countMax := 0, 0

	for i := 0; i < n; i++ {
		if b[i] == min {
			countMin++
		}

		if b[i] == max {
			countMax++
		}
	}

	if countMax == n {
		println(0, n * (n - 1) / 2)
	} else {
		println(max - min, int64(countMax) * int64(countMin))
	}
}

func next() string {
	if !scanner.Scan() {
		panic("Scan error")
	}
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(next())
	if err != nil {
		panic(err)
	}
	return n
}

func nextFloat() float64 {
	n, err := strconv.ParseFloat(next(), 64)
	if err != nil {
		panic(err)
	}
	return n
}

func println(a ...interface{}) {
	fmt.Fprintln(writer, a...)
}

func print(a ...interface{}) {
	fmt.Fprint(writer, a...)
}

func printf(format string, a ...interface{}) {
	fmt.Fprintf(writer, format, a...)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
var writer = bufio.NewWriter(os.Stdout)

//Wrong
func main() {
	defer writer.Flush()
	scanner.Split(bufio.ScanWords)

	n := nextInt()
	b := make([]int, n)
	min, max := 1<<31 -1, 0

	for i := 0; i < n; i++ {
		b[i] = nextInt()

		if b[i] < min {
			min = b[i]
		}

		if b[i] > max {
			max = b[i]
		}
	}

	countMin, countMax := 0, 0

	for i := 0; i < n; i++ {
		if b[i] == min {
			countMin++
		}

		if b[i] == max {
			countMax++
		}
	}

	if countMax == n {
		println(0, int64(n) * int64(n) - 1 / 2)
	} else {
		println(max - min, int64(int64(countMax) * int64(countMin)))
	}
	// fmt.Printf("%T\n", int64(countMax) * int64(countMin))
}

func next() string {
	if !scanner.Scan() {
		panic("Scan error")
	}
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(next())
	if err != nil {
		panic(err)
	}
	return n
}

func nextFloat() float64 {
	n, err := strconv.ParseFloat(next(), 64)
	if err != nil {
		panic(err)
	}
	return n
}

func println(a ...interface{}) {
	fmt.Fprintln(writer, a...)
}

func print(a ...interface{}) {
	fmt.Fprint(writer, a...)
}

func printf(format string, a ...interface{}) {
	fmt.Fprintf(writer, format, a...)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
var writer = bufio.NewWriter(os.Stdout)

//Wrong
func main() {
	defer writer.Flush()
	scanner.Split(bufio.ScanWords)

	n := nextInt()
	b := make([]int, n)
	min, max := 1<<31 -1, 0

	for i := 0; i < n; i++ {
		b[i] = nextInt()

		if b[i] < min {
			min = b[i]
		}

		if b[i] > max {
			max = b[i]
		}
	}

	countMin, countMax := 0, 0

	for i := 0; i < n; i++ {
		if b[i] == min {
			countMin++
		}

		if b[i] == max {
			countMax++
		}
	}

	if countMax == n {
		println(0, int64(n) * int64(n) - 1 / 2)
	} else {
		println(max - min, int64(int64(countMax) * int64(countMin)))
	}
}

func next() string {
	if !scanner.Scan() {
		panic("Scan error")
	}
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(next())
	if err != nil {
		panic(err)
	}
	return n
}

func nextFloat() float64 {
	n, err := strconv.ParseFloat(next(), 64)
	if err != nil {
		panic(err)
	}
	return n
}

func println(a ...interface{}) {
	fmt.Fprintln(writer, a...)
}

func print(a ...interface{}) {
	fmt.Fprint(writer, a...)
}

func printf(format string, a ...interface{}) {
	fmt.Fprintf(writer, format, a...)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
var writer = bufio.NewWriter(os.Stdout)

//Wrong
func main() {
	defer writer.Flush()
	scanner.Split(bufio.ScanWords)

	n := nextInt()
	b := make([]int, n)
	min, max := 1<<31 -1, 0

	for i := 0; i < n; i++ {
		b[i] = nextInt()

		if b[i] < min {
			min = b[i]
		}

		if b[i] > max {
			max = b[i]
		}
	}

	countMin, countMax := 0, 0

	for i := 0; i < n; i++ {
		if b[i] == min {
			countMin++
		}

		if b[i] == max {
			countMax++
		}
	}

	if countMax == n {
		println(0, int64(n * (n - 1) / 2))
	} else {
		println(max - min, int64(int64(countMax) * int64(countMin)))
	}
	// fmt.Printf("%T\n", int64(countMax) * int64(countMin))
}

func next() string {
	if !scanner.Scan() {
		panic("Scan error")
	}
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(next())
	if err != nil {
		panic(err)
	}
	return n
}

func nextFloat() float64 {
	n, err := strconv.ParseFloat(next(), 64)
	if err != nil {
		panic(err)
	}
	return n
}

func println(a ...interface{}) {
	fmt.Fprintln(writer, a...)
}

func print(a ...interface{}) {
	fmt.Fprint(writer, a...)
}

func printf(format string, a ...interface{}) {
	fmt.Fprintf(writer, format, a...)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
var writer = bufio.NewWriter(os.Stdout)

//Wrong
func main() {
	defer writer.Flush()
	scanner.Split(bufio.ScanWords)

	n := nextInt()
	b := make([]int, n)
	min, max := 1<<31 -1, 0

	for i := 0; i < n; i++ {
		b[i] = nextInt()

		if b[i] < min {
			min = b[i]
		}

		if b[i] > max {
			max = b[i]
		}
	}

	countMin, countMax := 0, 0

	for i := 0; i < n; i++ {
		if b[i] == min {
			countMin++
		}

		if b[i] == max {
			countMax++
		}
	}

	if countMax == n {
		println(0, n * (n - 1) / 2)
	} else {
		println(max - min, int64(int64(countMax) * int64(countMin)))
	}
	// fmt.Printf("%T\n", int64(countMax) * int64(countMin))
}

func next() string {
	if !scanner.Scan() {
		panic("Scan error")
	}
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(next())
	if err != nil {
		panic(err)
	}
	return n
}

func nextFloat() float64 {
	n, err := strconv.ParseFloat(next(), 64)
	if err != nil {
		panic(err)
	}
	return n
}

func println(a ...interface{}) {
	fmt.Fprintln(writer, a...)
}

func print(a ...interface{}) {
	fmt.Fprint(writer, a...)
}

func printf(format string, a ...interface{}) {
	fmt.Fprintf(writer, format, a...)
}

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var scanner = bufio.NewScanner(os.Stdin)
var writer = bufio.NewWriter(os.Stdout)

//Wrong
func main() {
	defer writer.Flush()
	scanner.Split(bufio.ScanWords)

	n := nextInt()
	b := make([]int, n)
	min, max := 1<<31 -1, 0

	for i := 0; i < n; i++ {
		b[i] = nextInt()

		if b[i] < min {
			min = b[i]
		}

		if b[i] > max {
			max = b[i]
		}
	}

	countMin, countMax := 0, 0

	for i := 0; i < n; i++ {
		if b[i] == min {
			countMin++
		}

		if b[i] == max {
			countMax++
		}
	}

	println(max - min, int64(countMax) * int64(countMin))
}

func next() string {
	if !scanner.Scan() {
		panic("Scan error")
	}
	return scanner.Text()
}

func nextInt() int {
	n, err := strconv.Atoi(next())
	if err != nil {
		panic(err)
	}
	return n
}

func nextFloat() float64 {
	n, err := strconv.ParseFloat(next(), 64)
	if err != nil {
		panic(err)
	}
	return n
}

func println(a ...interface{}) {
	fmt.Fprintln(writer, a...)
}

func print(a ...interface{}) {
	fmt.Fprint(writer, a...)
}

func printf(format string, a ...interface{}) {
	fmt.Fprintf(writer, format, a...)
}